./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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_d6b212ee-ddab-48c2-b726-551cc056acfb/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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:24:18,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:24:18,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:24:18,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:24:18,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:24:18,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:24:18,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:24:18,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:24:18,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:24:18,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:24:18,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:24:18,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:24:18,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:24:18,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:24:18,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:24:18,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:24:18,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:24:18,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:24:18,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:24:18,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:24:18,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:24:18,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:24:18,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:24:18,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:24:18,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:24:18,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:24:18,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:24:18,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:24:18,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:24:18,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:24:18,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:24:18,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:24:18,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:24:18,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:24:18,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:24:18,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:24:18,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:24:18,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:24:18,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:24:18,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:24:18,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:24:18,776 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 12:24:18,795 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:24:18,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:24:18,795 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:24:18,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:24:18,796 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:24:18,797 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:24:18,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:24:18,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:24:18,798 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:24:18,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:24:18,798 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:24:18,798 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:24:18,799 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:24:18,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:24:18,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:24:18,799 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 12:24:18,799 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 12:24:18,800 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 12:24:18,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:24:18,800 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 12:24:18,800 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:24:18,800 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:24:18,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:24:18,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:24:18,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:24:18,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:24:18,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:24:18,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:24:18,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:24:18,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:24:18,802 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_d6b212ee-ddab-48c2-b726-551cc056acfb/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_d6b212ee-ddab-48c2-b726-551cc056acfb/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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2022-11-20 12:24:19,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:24:19,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:24:19,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:24:19,086 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:24:19,086 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:24:19,088 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-20 12:24:22,140 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:24:22,523 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:24:22,534 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-20 12:24:22,553 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/data/4d43f9235/dd40a0416dd140aa810fa82d2c96c647/FLAGd85f027c5 [2022-11-20 12:24:22,569 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/data/4d43f9235/dd40a0416dd140aa810fa82d2c96c647 [2022-11-20 12:24:22,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:24:22,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:24:22,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:24:22,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:24:22,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:24:22,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:24:22" (1/1) ... [2022-11-20 12:24:22,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2769cc16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:24:22, skipping insertion in model container [2022-11-20 12:24:22,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:24:22" (1/1) ... [2022-11-20 12:24:22,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:24:22,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:24:22,821 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_d6b212ee-ddab-48c2-b726-551cc056acfb/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-20 12:24:23,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:24:23,184 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:24:23,197 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_d6b212ee-ddab-48c2-b726-551cc056acfb/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-20 12:24:23,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:24:23,320 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:24:23,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:24:23 WrapperNode [2022-11-20 12:24:23,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:24:23,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:24:23,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:24:23,322 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:24:23,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:24:23" (1/1) ... [2022-11-20 12:24:23,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:24:23" (1/1) ... [2022-11-20 12:24:23,379 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-20 12:24:23,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:24:23,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:24:23,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:24:23,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:24:23,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:24:23" (1/1) ... [2022-11-20 12:24:23,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:24:23" (1/1) ... [2022-11-20 12:24:23,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:24:23" (1/1) ... [2022-11-20 12:24:23,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:24:23" (1/1) ... [2022-11-20 12:24:23,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:24:23" (1/1) ... [2022-11-20 12:24:23,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:24:23" (1/1) ... [2022-11-20 12:24:23,429 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:24:23" (1/1) ... [2022-11-20 12:24:23,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:24:23" (1/1) ... [2022-11-20 12:24:23,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:24:23,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:24:23,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:24:23,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:24:23,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:24:23" (1/1) ... [2022-11-20 12:24:23,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:24:23,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:24:23,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:24:23,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:24:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:24:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:24:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:24:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:24:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:24:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 12:24:23,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 12:24:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 12:24:23,542 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 12:24:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 12:24:23,542 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 12:24:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:24:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:24:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:24:23,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:24:23,545 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 12:24:23,790 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:24:23,792 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:24:24,232 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:24:24,460 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:24:24,460 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:24:24,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:24:24 BoogieIcfgContainer [2022-11-20 12:24:24,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:24:24,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:24:24,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:24:24,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:24:24,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:24:22" (1/3) ... [2022-11-20 12:24:24,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d74c224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:24:24, skipping insertion in model container [2022-11-20 12:24:24,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:24:23" (2/3) ... [2022-11-20 12:24:24,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d74c224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:24:24, skipping insertion in model container [2022-11-20 12:24:24,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:24:24" (3/3) ... [2022-11-20 12:24:24,515 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-20 12:24:24,535 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:24:24,537 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-20 12:24:24,537 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:24:24,602 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:24:24,650 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 12:24:24,671 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 263 flow [2022-11-20 12:24:24,676 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 263 flow [2022-11-20 12:24:24,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-11-20 12:24:24,765 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-11-20 12:24:24,765 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:24:24,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-20 12:24:24,774 INFO L119 LiptonReduction]: Number of co-enabled transitions 2264 [2022-11-20 12:24:31,403 INFO L134 LiptonReduction]: Checked pairs total: 5891 [2022-11-20 12:24:31,404 INFO L136 LiptonReduction]: Total number of compositions: 119 [2022-11-20 12:24:31,414 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-20 12:24:31,532 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:31,558 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:24:31,566 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;@4604507c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:24:31,567 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-20 12:24:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:31,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 12:24:31,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:31,579 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 12:24:31,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:31,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:31,589 INFO L85 PathProgramCache]: Analyzing trace with hash 594, now seen corresponding path program 1 times [2022-11-20 12:24:31,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:31,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103677618] [2022-11-20 12:24:31,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:31,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:31,718 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 12:24:31,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:31,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103677618] [2022-11-20 12:24:31,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103677618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:31,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:31,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 12:24:31,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856529316] [2022-11-20 12:24:31,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:31,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 12:24:31,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:31,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 12:24:31,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:24:31,757 INFO L87 Difference]: Start difference. First operand has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:31,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:31,860 INFO L93 Difference]: Finished difference Result 970 states and 3096 transitions. [2022-11-20 12:24:31,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 12:24:31,863 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 12:24:31,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:31,885 INFO L225 Difference]: With dead ends: 970 [2022-11-20 12:24:31,885 INFO L226 Difference]: Without dead ends: 970 [2022-11-20 12:24:31,886 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 12:24:31,889 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:31,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:24:31,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-11-20 12:24:31,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2022-11-20 12:24:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 965 states have (on average 3.2082901554404146) internal successors, (3096), 969 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3096 transitions. [2022-11-20 12:24:32,005 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3096 transitions. Word has length 1 [2022-11-20 12:24:32,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:32,007 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 3096 transitions. [2022-11-20 12:24:32,009 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 12:24:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3096 transitions. [2022-11-20 12:24:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 12:24:32,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:32,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:32,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:24:32,013 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:32,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:32,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1738258061, now seen corresponding path program 1 times [2022-11-20 12:24:32,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:32,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506762872] [2022-11-20 12:24:32,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:32,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:24:32,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:32,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506762872] [2022-11-20 12:24:32,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506762872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:32,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:32,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:24:32,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020228190] [2022-11-20 12:24:32,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:32,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:24:32,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:32,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:24:32,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:24:32,469 INFO L87 Difference]: Start difference. First operand 970 states and 3096 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:32,586 INFO L93 Difference]: Finished difference Result 802 states and 2518 transitions. [2022-11-20 12:24:32,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:24:32,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 12:24:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:32,596 INFO L225 Difference]: With dead ends: 802 [2022-11-20 12:24:32,598 INFO L226 Difference]: Without dead ends: 778 [2022-11-20 12:24:32,599 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 12:24:32,606 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:32,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:24:32,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-11-20 12:24:32,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2022-11-20 12:24:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 776 states have (on average 3.1649484536082473) internal successors, (2456), 777 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 2456 transitions. [2022-11-20 12:24:32,649 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 2456 transitions. Word has length 7 [2022-11-20 12:24:32,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:32,650 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 2456 transitions. [2022-11-20 12:24:32,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:32,650 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 2456 transitions. [2022-11-20 12:24:32,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 12:24:32,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:32,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:32,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:24:32,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:32,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:32,658 INFO L85 PathProgramCache]: Analyzing trace with hash -21934738, now seen corresponding path program 1 times [2022-11-20 12:24:32,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:32,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328869467] [2022-11-20 12:24:32,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:32,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:33,318 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 12:24:33,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:33,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328869467] [2022-11-20 12:24:33,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328869467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:33,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:33,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:24:33,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170436267] [2022-11-20 12:24:33,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:33,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:24:33,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:33,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:24:33,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:24:33,322 INFO L87 Difference]: Start difference. First operand 778 states and 2456 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:33,521 INFO L93 Difference]: Finished difference Result 658 states and 2050 transitions. [2022-11-20 12:24:33,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:24:33,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 12:24:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:33,529 INFO L225 Difference]: With dead ends: 658 [2022-11-20 12:24:33,534 INFO L226 Difference]: Without dead ends: 658 [2022-11-20 12:24:33,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 12:24:33,536 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 24 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:33,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:24:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-11-20 12:24:33,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2022-11-20 12:24:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 3.1202435312024352) internal successors, (2050), 657 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states 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 12:24:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 2050 transitions. [2022-11-20 12:24:33,561 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 2050 transitions. Word has length 10 [2022-11-20 12:24:33,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:33,562 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 2050 transitions. [2022-11-20 12:24:33,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 2050 transitions. [2022-11-20 12:24:33,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 12:24:33,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:33,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:33,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:24:33,564 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:33,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash -21934756, now seen corresponding path program 1 times [2022-11-20 12:24:33,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:33,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485953605] [2022-11-20 12:24:33,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:33,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:33,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:24:33,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:33,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485953605] [2022-11-20 12:24:33,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485953605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:33,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:33,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:24:33,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815336812] [2022-11-20 12:24:33,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:33,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:24:33,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:33,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:24:33,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:24:33,803 INFO L87 Difference]: Start difference. First operand 658 states and 2050 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 12:24:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:33,982 INFO L93 Difference]: Finished difference Result 754 states and 2256 transitions. [2022-11-20 12:24:33,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:24:33,983 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 12:24:33,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:33,988 INFO L225 Difference]: With dead ends: 754 [2022-11-20 12:24:33,988 INFO L226 Difference]: Without dead ends: 634 [2022-11-20 12:24:33,988 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 12:24:33,991 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:33,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:24:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-11-20 12:24:34,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2022-11-20 12:24:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 3.0932069510268563) internal successors, (1958), 633 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states 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 12:24:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1958 transitions. [2022-11-20 12:24:34,018 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1958 transitions. Word has length 10 [2022-11-20 12:24:34,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:34,020 INFO L495 AbstractCegarLoop]: Abstraction has 634 states and 1958 transitions. [2022-11-20 12:24:34,021 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 12:24:34,021 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1958 transitions. [2022-11-20 12:24:34,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 12:24:34,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:34,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:34,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:24:34,031 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:34,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:34,031 INFO L85 PathProgramCache]: Analyzing trace with hash -679977483, now seen corresponding path program 1 times [2022-11-20 12:24:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:34,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110286667] [2022-11-20 12:24:34,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:34,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:34,498 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 12:24:34,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:34,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110286667] [2022-11-20 12:24:34,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110286667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:34,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:34,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:24:34,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423680504] [2022-11-20 12:24:34,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:34,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:24:34,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:34,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:24:34,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:24:34,500 INFO L87 Difference]: Start difference. First operand 634 states and 1958 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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 12:24:34,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:34,893 INFO L93 Difference]: Finished difference Result 700 states and 2089 transitions. [2022-11-20 12:24:34,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:24:34,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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 12:24:34,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:34,898 INFO L225 Difference]: With dead ends: 700 [2022-11-20 12:24:34,899 INFO L226 Difference]: Without dead ends: 580 [2022-11-20 12:24:34,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:24:34,900 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 49 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:34,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 5 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:24:34,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2022-11-20 12:24:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 538. [2022-11-20 12:24:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 2.996275605214153) internal successors, (1609), 537 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1609 transitions. [2022-11-20 12:24:34,932 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1609 transitions. Word has length 11 [2022-11-20 12:24:34,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:34,932 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 1609 transitions. [2022-11-20 12:24:34,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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 12:24:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1609 transitions. [2022-11-20 12:24:34,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 12:24:34,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:34,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:34,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:24:34,936 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:34,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:34,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1600954828, now seen corresponding path program 1 times [2022-11-20 12:24:34,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:34,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402550848] [2022-11-20 12:24:34,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:34,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:35,620 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 12:24:35,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:35,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402550848] [2022-11-20 12:24:35,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402550848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:35,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:35,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:24:35,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437916673] [2022-11-20 12:24:35,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:35,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:24:35,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:35,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:24:35,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:24:35,623 INFO L87 Difference]: Start difference. First operand 538 states and 1609 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:35,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:35,858 INFO L93 Difference]: Finished difference Result 607 states and 1778 transitions. [2022-11-20 12:24:35,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:24:35,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 12:24:35,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:35,862 INFO L225 Difference]: With dead ends: 607 [2022-11-20 12:24:35,862 INFO L226 Difference]: Without dead ends: 562 [2022-11-20 12:24:35,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:24:35,863 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:35,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:24:35,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-11-20 12:24:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 542. [2022-11-20 12:24:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 2.9944547134935307) internal successors, (1620), 541 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states 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 12:24:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1620 transitions. [2022-11-20 12:24:35,884 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1620 transitions. Word has length 14 [2022-11-20 12:24:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:35,884 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 1620 transitions. [2022-11-20 12:24:35,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1620 transitions. [2022-11-20 12:24:35,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 12:24:35,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:35,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:35,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:24:35,886 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:35,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:35,887 INFO L85 PathProgramCache]: Analyzing trace with hash -682532366, now seen corresponding path program 2 times [2022-11-20 12:24:35,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:35,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279001234] [2022-11-20 12:24:35,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:35,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:37,400 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 12:24:37,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:37,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279001234] [2022-11-20 12:24:37,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279001234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:37,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:37,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:24:37,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946615378] [2022-11-20 12:24:37,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:37,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:24:37,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:37,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:24:37,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:24:37,403 INFO L87 Difference]: Start difference. First operand 542 states and 1620 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:37,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:37,771 INFO L93 Difference]: Finished difference Result 629 states and 1834 transitions. [2022-11-20 12:24:37,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:24:37,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 12:24:37,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:37,776 INFO L225 Difference]: With dead ends: 629 [2022-11-20 12:24:37,776 INFO L226 Difference]: Without dead ends: 584 [2022-11-20 12:24:37,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:24:37,777 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:37,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 11 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:24:37,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-11-20 12:24:37,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 520. [2022-11-20 12:24:37,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 519 states have (on average 2.984585741811175) internal successors, (1549), 519 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states 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 12:24:37,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1549 transitions. [2022-11-20 12:24:37,803 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1549 transitions. Word has length 14 [2022-11-20 12:24:37,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:37,804 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 1549 transitions. [2022-11-20 12:24:37,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:37,805 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1549 transitions. [2022-11-20 12:24:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 12:24:37,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:37,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:37,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:24:37,808 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:37,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:37,808 INFO L85 PathProgramCache]: Analyzing trace with hash 515937459, now seen corresponding path program 1 times [2022-11-20 12:24:37,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:37,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128394150] [2022-11-20 12:24:37,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:37,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:38,227 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 12:24:38,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:38,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128394150] [2022-11-20 12:24:38,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128394150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:38,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:38,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:24:38,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322471382] [2022-11-20 12:24:38,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:38,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:24:38,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:38,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:24:38,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:24:38,229 INFO L87 Difference]: Start difference. First operand 520 states and 1549 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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 12:24:38,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:38,463 INFO L93 Difference]: Finished difference Result 781 states and 2248 transitions. [2022-11-20 12:24:38,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:24:38,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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 12:24:38,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:38,467 INFO L225 Difference]: With dead ends: 781 [2022-11-20 12:24:38,467 INFO L226 Difference]: Without dead ends: 547 [2022-11-20 12:24:38,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:24:38,468 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:38,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:24:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-11-20 12:24:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 490. [2022-11-20 12:24:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 2.8752556237218814) internal successors, (1406), 489 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states 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 12:24:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1406 transitions. [2022-11-20 12:24:38,485 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1406 transitions. Word has length 15 [2022-11-20 12:24:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:38,486 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 1406 transitions. [2022-11-20 12:24:38,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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 12:24:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1406 transitions. [2022-11-20 12:24:38,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 12:24:38,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:38,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:38,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:24:38,493 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:38,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:38,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1800767993, now seen corresponding path program 1 times [2022-11-20 12:24:38,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:38,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046291315] [2022-11-20 12:24:38,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:38,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:39,519 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 12:24:39,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:39,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046291315] [2022-11-20 12:24:39,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046291315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:39,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:39,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:24:39,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360556438] [2022-11-20 12:24:39,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:39,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:24:39,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:39,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:24:39,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:24:39,521 INFO L87 Difference]: Start difference. First operand 490 states and 1406 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:39,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:39,990 INFO L93 Difference]: Finished difference Result 978 states and 2745 transitions. [2022-11-20 12:24:39,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:24:39,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 12:24:39,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:39,995 INFO L225 Difference]: With dead ends: 978 [2022-11-20 12:24:39,995 INFO L226 Difference]: Without dead ends: 688 [2022-11-20 12:24:39,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:24:39,996 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 54 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:39,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 14 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:24:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-11-20 12:24:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 526. [2022-11-20 12:24:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 2.803809523809524) internal successors, (1472), 525 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states 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 12:24:40,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 1472 transitions. [2022-11-20 12:24:40,016 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 1472 transitions. Word has length 15 [2022-11-20 12:24:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:40,017 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 1472 transitions. [2022-11-20 12:24:40,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:40,017 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 1472 transitions. [2022-11-20 12:24:40,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 12:24:40,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:40,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:40,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:24:40,019 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:40,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:40,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1911199571, now seen corresponding path program 2 times [2022-11-20 12:24:40,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:40,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037031336] [2022-11-20 12:24:40,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:40,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:40,586 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 12:24:40,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:40,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037031336] [2022-11-20 12:24:40,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037031336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:40,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:40,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:24:40,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163814998] [2022-11-20 12:24:40,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:40,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:24:40,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:40,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:24:40,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:24:40,589 INFO L87 Difference]: Start difference. First operand 526 states and 1472 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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 12:24:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:40,832 INFO L93 Difference]: Finished difference Result 600 states and 1649 transitions. [2022-11-20 12:24:40,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:24:40,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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 12:24:40,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:40,835 INFO L225 Difference]: With dead ends: 600 [2022-11-20 12:24:40,836 INFO L226 Difference]: Without dead ends: 564 [2022-11-20 12:24:40,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:24:40,837 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:40,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 9 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:24:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-11-20 12:24:40,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 536. [2022-11-20 12:24:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 2.798130841121495) internal successors, (1497), 535 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states 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 12:24:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1497 transitions. [2022-11-20 12:24:40,859 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1497 transitions. Word has length 15 [2022-11-20 12:24:40,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:40,859 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 1497 transitions. [2022-11-20 12:24:40,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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 12:24:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1497 transitions. [2022-11-20 12:24:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 12:24:40,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:40,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:40,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:24:40,862 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:40,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:40,866 INFO L85 PathProgramCache]: Analyzing trace with hash 267773757, now seen corresponding path program 3 times [2022-11-20 12:24:40,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:40,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534933830] [2022-11-20 12:24:40,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:40,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:41,934 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 12:24:41,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:41,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534933830] [2022-11-20 12:24:41,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534933830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:41,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:41,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:24:41,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751391745] [2022-11-20 12:24:41,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:41,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:24:41,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:41,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:24:41,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:24:41,938 INFO L87 Difference]: Start difference. First operand 536 states and 1497 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:42,304 INFO L93 Difference]: Finished difference Result 604 states and 1657 transitions. [2022-11-20 12:24:42,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:24:42,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 12:24:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:42,307 INFO L225 Difference]: With dead ends: 604 [2022-11-20 12:24:42,307 INFO L226 Difference]: Without dead ends: 564 [2022-11-20 12:24:42,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:24:42,308 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 50 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:42,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 9 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:24:42,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-11-20 12:24:42,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 548. [2022-11-20 12:24:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 2.7989031078610602) internal successors, (1531), 547 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states 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 12:24:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1531 transitions. [2022-11-20 12:24:42,333 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1531 transitions. Word has length 15 [2022-11-20 12:24:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:42,333 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 1531 transitions. [2022-11-20 12:24:42,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1531 transitions. [2022-11-20 12:24:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 12:24:42,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:42,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:42,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:24:42,336 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:42,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:42,336 INFO L85 PathProgramCache]: Analyzing trace with hash 315141447, now seen corresponding path program 4 times [2022-11-20 12:24:42,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:42,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182810318] [2022-11-20 12:24:42,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:42,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:43,161 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 12:24:43,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:43,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182810318] [2022-11-20 12:24:43,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182810318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:43,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:43,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:24:43,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785551992] [2022-11-20 12:24:43,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:43,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:24:43,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:43,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:24:43,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:24:43,163 INFO L87 Difference]: Start difference. First operand 548 states and 1531 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:43,587 INFO L93 Difference]: Finished difference Result 650 states and 1779 transitions. [2022-11-20 12:24:43,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:24:43,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 12:24:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:43,592 INFO L225 Difference]: With dead ends: 650 [2022-11-20 12:24:43,592 INFO L226 Difference]: Without dead ends: 566 [2022-11-20 12:24:43,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:24:43,593 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 43 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:43,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 15 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:24:43,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-11-20 12:24:43,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 508. [2022-11-20 12:24:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 2.7633136094674557) internal successors, (1401), 507 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states 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 12:24:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1401 transitions. [2022-11-20 12:24:43,626 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1401 transitions. Word has length 15 [2022-11-20 12:24:43,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:43,626 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 1401 transitions. [2022-11-20 12:24:43,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:43,627 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1401 transitions. [2022-11-20 12:24:43,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:24:43,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:43,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:43,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:24:43,629 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:43,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:43,629 INFO L85 PathProgramCache]: Analyzing trace with hash 10696865, now seen corresponding path program 1 times [2022-11-20 12:24:43,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:43,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092160480] [2022-11-20 12:24:43,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:43,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:24:44,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:44,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092160480] [2022-11-20 12:24:44,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092160480] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:44,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:44,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:24:44,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174685664] [2022-11-20 12:24:44,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:44,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:24:44,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:44,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:24:44,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:24:44,766 INFO L87 Difference]: Start difference. First operand 508 states and 1401 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:45,245 INFO L93 Difference]: Finished difference Result 628 states and 1709 transitions. [2022-11-20 12:24:45,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:24:45,246 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 12:24:45,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:45,248 INFO L225 Difference]: With dead ends: 628 [2022-11-20 12:24:45,249 INFO L226 Difference]: Without dead ends: 442 [2022-11-20 12:24:45,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:24:45,249 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 74 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:45,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 11 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:24:45,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-11-20 12:24:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2022-11-20 12:24:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 2.6825396825396823) internal successors, (1183), 441 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states 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 12:24:45,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1183 transitions. [2022-11-20 12:24:45,264 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1183 transitions. Word has length 16 [2022-11-20 12:24:45,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:45,264 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 1183 transitions. [2022-11-20 12:24:45,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1183 transitions. [2022-11-20 12:24:45,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:24:45,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:45,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:45,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:24:45,266 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:45,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:45,267 INFO L85 PathProgramCache]: Analyzing trace with hash 880418981, now seen corresponding path program 1 times [2022-11-20 12:24:45,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:45,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111139072] [2022-11-20 12:24:45,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:45,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:46,834 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 12:24:46,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:46,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111139072] [2022-11-20 12:24:46,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111139072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:46,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:46,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:24:46,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610257428] [2022-11-20 12:24:46,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:46,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:24:46,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:46,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:24:46,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:24:46,836 INFO L87 Difference]: Start difference. First operand 442 states and 1183 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:47,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:47,528 INFO L93 Difference]: Finished difference Result 520 states and 1348 transitions. [2022-11-20 12:24:47,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:24:47,529 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 12:24:47,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:47,531 INFO L225 Difference]: With dead ends: 520 [2022-11-20 12:24:47,531 INFO L226 Difference]: Without dead ends: 464 [2022-11-20 12:24:47,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-11-20 12:24:47,532 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 85 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:47,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 15 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:24:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-11-20 12:24:47,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 426. [2022-11-20 12:24:47,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 2.6470588235294117) internal successors, (1125), 425 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states 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 12:24:47,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1125 transitions. [2022-11-20 12:24:47,545 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1125 transitions. Word has length 16 [2022-11-20 12:24:47,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:47,546 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 1125 transitions. [2022-11-20 12:24:47,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:47,546 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1125 transitions. [2022-11-20 12:24:47,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:24:47,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:47,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:47,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:24:47,548 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:47,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:47,549 INFO L85 PathProgramCache]: Analyzing trace with hash 882285243, now seen corresponding path program 2 times [2022-11-20 12:24:47,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:47,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762618846] [2022-11-20 12:24:47,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:47,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:48,533 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 12:24:48,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:48,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762618846] [2022-11-20 12:24:48,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762618846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:48,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:48,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:24:48,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151506322] [2022-11-20 12:24:48,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:48,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:24:48,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:48,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:24:48,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:24:48,535 INFO L87 Difference]: Start difference. First operand 426 states and 1125 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:49,131 INFO L93 Difference]: Finished difference Result 604 states and 1535 transitions. [2022-11-20 12:24:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:24:49,131 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 12:24:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:49,134 INFO L225 Difference]: With dead ends: 604 [2022-11-20 12:24:49,134 INFO L226 Difference]: Without dead ends: 548 [2022-11-20 12:24:49,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-11-20 12:24:49,135 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 89 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:49,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 11 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:24:49,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-11-20 12:24:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 462. [2022-11-20 12:24:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 2.633405639913232) internal successors, (1214), 461 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states 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 12:24:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1214 transitions. [2022-11-20 12:24:49,153 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1214 transitions. Word has length 16 [2022-11-20 12:24:49,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:49,153 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 1214 transitions. [2022-11-20 12:24:49,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1214 transitions. [2022-11-20 12:24:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:24:49,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:49,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:49,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 12:24:49,155 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:49,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash 16046783, now seen corresponding path program 3 times [2022-11-20 12:24:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:49,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072603654] [2022-11-20 12:24:49,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:49,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:24:50,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:50,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072603654] [2022-11-20 12:24:50,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072603654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:50,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:50,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:24:50,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079656805] [2022-11-20 12:24:50,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:50,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:24:50,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:50,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:24:50,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:24:50,016 INFO L87 Difference]: Start difference. First operand 462 states and 1214 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:50,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:50,323 INFO L93 Difference]: Finished difference Result 545 states and 1393 transitions. [2022-11-20 12:24:50,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:24:50,323 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 12:24:50,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:50,326 INFO L225 Difference]: With dead ends: 545 [2022-11-20 12:24:50,326 INFO L226 Difference]: Without dead ends: 497 [2022-11-20 12:24:50,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:24:50,327 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 50 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:50,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 12 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:24:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-11-20 12:24:50,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 424. [2022-11-20 12:24:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 2.624113475177305) internal successors, (1110), 423 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states 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 12:24:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1110 transitions. [2022-11-20 12:24:50,341 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1110 transitions. Word has length 16 [2022-11-20 12:24:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:50,341 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 1110 transitions. [2022-11-20 12:24:50,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1110 transitions. [2022-11-20 12:24:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:24:50,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:50,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:50,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 12:24:50,343 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:50,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:50,344 INFO L85 PathProgramCache]: Analyzing trace with hash -290884587, now seen corresponding path program 2 times [2022-11-20 12:24:50,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:50,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589829245] [2022-11-20 12:24:50,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:50,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:51,683 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 12:24:51,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:51,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589829245] [2022-11-20 12:24:51,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589829245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:51,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:51,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:24:51,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389150243] [2022-11-20 12:24:51,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:51,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:24:51,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:51,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:24:51,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:24:51,686 INFO L87 Difference]: Start difference. First operand 424 states and 1110 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:52,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:52,125 INFO L93 Difference]: Finished difference Result 474 states and 1216 transitions. [2022-11-20 12:24:52,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:24:52,125 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 12:24:52,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:52,127 INFO L225 Difference]: With dead ends: 474 [2022-11-20 12:24:52,128 INFO L226 Difference]: Without dead ends: 432 [2022-11-20 12:24:52,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:24:52,129 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 43 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:52,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 13 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:24:52,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-11-20 12:24:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 420. [2022-11-20 12:24:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 2.6252983293556085) internal successors, (1100), 419 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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 12:24:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1100 transitions. [2022-11-20 12:24:52,140 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1100 transitions. Word has length 16 [2022-11-20 12:24:52,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:52,140 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 1100 transitions. [2022-11-20 12:24:52,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1100 transitions. [2022-11-20 12:24:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:24:52,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:52,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:52,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 12:24:52,143 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:52,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:52,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1177513803, now seen corresponding path program 3 times [2022-11-20 12:24:52,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:52,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644086500] [2022-11-20 12:24:52,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:52,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:53,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 12:24:53,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:53,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644086500] [2022-11-20 12:24:53,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644086500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:53,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:53,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:24:53,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101952194] [2022-11-20 12:24:53,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:53,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:24:53,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:53,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:24:53,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:24:53,298 INFO L87 Difference]: Start difference. First operand 420 states and 1100 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:53,889 INFO L93 Difference]: Finished difference Result 471 states and 1196 transitions. [2022-11-20 12:24:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:24:53,889 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 12:24:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:53,891 INFO L225 Difference]: With dead ends: 471 [2022-11-20 12:24:53,892 INFO L226 Difference]: Without dead ends: 395 [2022-11-20 12:24:53,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-20 12:24:53,892 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 84 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:53,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 13 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:24:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-11-20 12:24:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 360. [2022-11-20 12:24:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 2.632311977715877) internal successors, (945), 359 states have internal predecessors, (945), 0 states have call successors, (0), 0 states 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 12:24:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 945 transitions. [2022-11-20 12:24:53,903 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 945 transitions. Word has length 16 [2022-11-20 12:24:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:53,904 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 945 transitions. [2022-11-20 12:24:53,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 945 transitions. [2022-11-20 12:24:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 12:24:53,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:53,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:53,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 12:24:53,907 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:53,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:53,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1892959468, now seen corresponding path program 1 times [2022-11-20 12:24:53,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:53,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442544242] [2022-11-20 12:24:53,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:53,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:54,096 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 12:24:54,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:54,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442544242] [2022-11-20 12:24:54,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442544242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:54,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:54,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:24:54,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051748694] [2022-11-20 12:24:54,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:54,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:24:54,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:54,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:24:54,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:24:54,099 INFO L87 Difference]: Start difference. First operand 360 states and 945 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:54,161 INFO L93 Difference]: Finished difference Result 248 states and 557 transitions. [2022-11-20 12:24:54,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:24:54,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 12:24:54,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:54,163 INFO L225 Difference]: With dead ends: 248 [2022-11-20 12:24:54,163 INFO L226 Difference]: Without dead ends: 248 [2022-11-20 12:24:54,163 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 12:24:54,164 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:54,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:24:54,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-20 12:24:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2022-11-20 12:24:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 2.2550607287449393) internal successors, (557), 247 states have internal predecessors, (557), 0 states have call successors, (0), 0 states 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 12:24:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 557 transitions. [2022-11-20 12:24:54,170 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 557 transitions. Word has length 17 [2022-11-20 12:24:54,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:54,171 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 557 transitions. [2022-11-20 12:24:54,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 557 transitions. [2022-11-20 12:24:54,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 12:24:54,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:54,172 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 12:24:54,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 12:24:54,173 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:54,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:54,173 INFO L85 PathProgramCache]: Analyzing trace with hash -606603118, now seen corresponding path program 1 times [2022-11-20 12:24:54,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:54,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988868189] [2022-11-20 12:24:54,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:54,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:54,349 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 12:24:54,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:54,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988868189] [2022-11-20 12:24:54,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988868189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:54,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:54,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:24:54,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880835932] [2022-11-20 12:24:54,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:54,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:24:54,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:54,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:24:54,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:24:54,351 INFO L87 Difference]: Start difference. First operand 248 states and 557 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:54,431 INFO L93 Difference]: Finished difference Result 156 states and 303 transitions. [2022-11-20 12:24:54,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:24:54,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 12:24:54,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:54,432 INFO L225 Difference]: With dead ends: 156 [2022-11-20 12:24:54,433 INFO L226 Difference]: Without dead ends: 156 [2022-11-20 12:24:54,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:24:54,433 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:54,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:24:54,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-20 12:24:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-11-20 12:24:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.9548387096774194) internal successors, (303), 155 states have internal predecessors, (303), 0 states have call successors, (0), 0 states 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 12:24:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 303 transitions. [2022-11-20 12:24:54,438 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 303 transitions. Word has length 18 [2022-11-20 12:24:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:54,438 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 303 transitions. [2022-11-20 12:24:54,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 303 transitions. [2022-11-20 12:24:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 12:24:54,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:54,439 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 12:24:54,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 12:24:54,439 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:54,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1262979808, now seen corresponding path program 1 times [2022-11-20 12:24:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:54,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625331901] [2022-11-20 12:24:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:55,727 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 12:24:55,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:55,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625331901] [2022-11-20 12:24:55,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625331901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:55,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:55,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:24:55,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110142537] [2022-11-20 12:24:55,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:55,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:24:55,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:55,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:24:55,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:24:55,728 INFO L87 Difference]: Start difference. First operand 156 states and 303 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 12:24:56,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:56,305 INFO L93 Difference]: Finished difference Result 267 states and 496 transitions. [2022-11-20 12:24:56,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:24:56,305 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 12:24:56,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:56,307 INFO L225 Difference]: With dead ends: 267 [2022-11-20 12:24:56,307 INFO L226 Difference]: Without dead ends: 233 [2022-11-20 12:24:56,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-20 12:24:56,308 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 64 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:56,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 13 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:24:56,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-11-20 12:24:56,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 170. [2022-11-20 12:24:56,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.9230769230769231) internal successors, (325), 169 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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 12:24:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 325 transitions. [2022-11-20 12:24:56,316 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 325 transitions. Word has length 19 [2022-11-20 12:24:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:56,316 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 325 transitions. [2022-11-20 12:24:56,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 12:24:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 325 transitions. [2022-11-20 12:24:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 12:24:56,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:56,318 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 12:24:56,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 12:24:56,318 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:56,318 INFO L85 PathProgramCache]: Analyzing trace with hash -82929022, now seen corresponding path program 2 times [2022-11-20 12:24:56,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:56,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469307163] [2022-11-20 12:24:56,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:56,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:57,882 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 12:24:57,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:57,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469307163] [2022-11-20 12:24:57,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469307163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:57,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:57,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:24:57,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335487811] [2022-11-20 12:24:57,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:57,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:24:57,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:57,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:24:57,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:24:57,884 INFO L87 Difference]: Start difference. First operand 170 states and 325 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 12:24:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:58,504 INFO L93 Difference]: Finished difference Result 187 states and 356 transitions. [2022-11-20 12:24:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:24:58,504 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 12:24:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:58,505 INFO L225 Difference]: With dead ends: 187 [2022-11-20 12:24:58,505 INFO L226 Difference]: Without dead ends: 160 [2022-11-20 12:24:58,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-11-20 12:24:58,506 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 67 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:58,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 13 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:24:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-20 12:24:58,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2022-11-20 12:24:58,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.9029850746268657) internal successors, (255), 134 states have internal predecessors, (255), 0 states have call successors, (0), 0 states 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 12:24:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 255 transitions. [2022-11-20 12:24:58,511 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 255 transitions. Word has length 19 [2022-11-20 12:24:58,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:58,511 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 255 transitions. [2022-11-20 12:24:58,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 12:24:58,512 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 255 transitions. [2022-11-20 12:24:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 12:24:58,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:58,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:58,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 12:24:58,513 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:58,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:58,513 INFO L85 PathProgramCache]: Analyzing trace with hash 667674163, now seen corresponding path program 1 times [2022-11-20 12:24:58,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:58,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672376073] [2022-11-20 12:24:58,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:58,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:24:59,005 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 12:24:59,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:24:59,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672376073] [2022-11-20 12:24:59,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672376073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:24:59,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:24:59,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:24:59,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932070377] [2022-11-20 12:24:59,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:24:59,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:24:59,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:24:59,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:24:59,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:24:59,008 INFO L87 Difference]: Start difference. First operand 135 states and 255 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:24:59,098 INFO L93 Difference]: Finished difference Result 105 states and 196 transitions. [2022-11-20 12:24:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:24:59,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 12:24:59,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:24:59,099 INFO L225 Difference]: With dead ends: 105 [2022-11-20 12:24:59,099 INFO L226 Difference]: Without dead ends: 97 [2022-11-20 12:24:59,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:24:59,100 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 54 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:24:59,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:24:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-20 12:24:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-11-20 12:24:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.826086956521739) internal successors, (168), 92 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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 12:24:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 168 transitions. [2022-11-20 12:24:59,103 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 168 transitions. Word has length 20 [2022-11-20 12:24:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:24:59,103 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 168 transitions. [2022-11-20 12:24:59,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:24:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 168 transitions. [2022-11-20 12:24:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:24:59,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:24:59,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:24:59,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 12:24:59,105 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:24:59,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:24:59,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1591931219, now seen corresponding path program 1 times [2022-11-20 12:24:59,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:24:59,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160175183] [2022-11-20 12:24:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:24:59,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:24:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:00,581 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 12:25:00,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:25:00,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160175183] [2022-11-20 12:25:00,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160175183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:00,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:00,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:25:00,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416777746] [2022-11-20 12:25:00,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:00,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:25:00,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:25:00,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:25:00,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:25:00,583 INFO L87 Difference]: Start difference. First operand 93 states and 168 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:01,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:01,119 INFO L93 Difference]: Finished difference Result 137 states and 240 transitions. [2022-11-20 12:25:01,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:25:01,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 12:25:01,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:01,121 INFO L225 Difference]: With dead ends: 137 [2022-11-20 12:25:01,121 INFO L226 Difference]: Without dead ends: 112 [2022-11-20 12:25:01,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:25:01,122 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 53 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:01,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 6 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:25:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-20 12:25:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 75. [2022-11-20 12:25:01,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.7297297297297298) internal successors, (128), 74 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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 12:25:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 128 transitions. [2022-11-20 12:25:01,126 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 128 transitions. Word has length 22 [2022-11-20 12:25:01,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:01,126 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 128 transitions. [2022-11-20 12:25:01,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 128 transitions. [2022-11-20 12:25:01,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:25:01,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:01,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:01,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 12:25:01,128 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:01,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:01,128 INFO L85 PathProgramCache]: Analyzing trace with hash -481200079, now seen corresponding path program 2 times [2022-11-20 12:25:01,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:25:01,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075176576] [2022-11-20 12:25:01,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:01,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:25:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:02,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:25:02,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:25:02,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075176576] [2022-11-20 12:25:02,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075176576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:02,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:02,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:25:02,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452001566] [2022-11-20 12:25:02,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:02,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:25:02,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:25:02,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:25:02,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:25:02,876 INFO L87 Difference]: Start difference. First operand 75 states and 128 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:03,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:03,518 INFO L93 Difference]: Finished difference Result 100 states and 170 transitions. [2022-11-20 12:25:03,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:25:03,518 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 12:25:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:03,519 INFO L225 Difference]: With dead ends: 100 [2022-11-20 12:25:03,519 INFO L226 Difference]: Without dead ends: 78 [2022-11-20 12:25:03,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-11-20 12:25:03,520 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 46 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:03,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 4 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:25:03,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-20 12:25:03,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2022-11-20 12:25:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.6865671641791045) internal successors, (113), 67 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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 12:25:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 113 transitions. [2022-11-20 12:25:03,523 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 113 transitions. Word has length 22 [2022-11-20 12:25:03,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:03,524 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 113 transitions. [2022-11-20 12:25:03,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 113 transitions. [2022-11-20 12:25:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:25:03,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:03,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] [2022-11-20 12:25:03,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 12:25:03,525 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:03,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:03,526 INFO L85 PathProgramCache]: Analyzing trace with hash 451746751, now seen corresponding path program 3 times [2022-11-20 12:25:03,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:25:03,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043866512] [2022-11-20 12:25:03,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:25:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:04,243 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 12:25:04,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:25:04,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043866512] [2022-11-20 12:25:04,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043866512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:04,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:04,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:25:04,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585481493] [2022-11-20 12:25:04,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:04,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:25:04,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:25:04,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:25:04,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:25:04,245 INFO L87 Difference]: Start difference. First operand 68 states and 113 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:04,579 INFO L93 Difference]: Finished difference Result 99 states and 168 transitions. [2022-11-20 12:25:04,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:25:04,579 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 12:25:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:04,580 INFO L225 Difference]: With dead ends: 99 [2022-11-20 12:25:04,580 INFO L226 Difference]: Without dead ends: 68 [2022-11-20 12:25:04,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:25:04,581 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 41 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:04,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 5 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:25:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-20 12:25:04,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2022-11-20 12:25:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 61 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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 12:25:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 99 transitions. [2022-11-20 12:25:04,584 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 99 transitions. Word has length 22 [2022-11-20 12:25:04,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:04,584 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 99 transitions. [2022-11-20 12:25:04,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:04,584 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 99 transitions. [2022-11-20 12:25:04,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:25:04,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:04,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:04,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 12:25:04,586 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:04,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:04,586 INFO L85 PathProgramCache]: Analyzing trace with hash -457144029, now seen corresponding path program 4 times [2022-11-20 12:25:04,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:25:04,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399476619] [2022-11-20 12:25:04,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:04,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:25:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:25:04,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:25:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:25:04,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:25:04,704 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:25:04,705 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-20 12:25:04,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-20 12:25:04,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-20 12:25:04,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-20 12:25:04,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-20 12:25:04,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-20 12:25:04,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-20 12:25:04,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-20 12:25:04,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-20 12:25:04,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-20 12:25:04,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-20 12:25:04,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-20 12:25:04,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-20 12:25:04,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 12:25:04,713 INFO L444 BasicCegarLoop]: Path program histogram: [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:04,719 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 12:25:04,719 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:25:04,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:25:04 BasicIcfg [2022-11-20 12:25:04,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:25:04,781 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:25:04,781 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:25:04,781 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:25:04,782 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:24:24" (3/4) ... [2022-11-20 12:25:04,784 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 12:25:04,784 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:25:04,785 INFO L158 Benchmark]: Toolchain (without parser) took 42207.68ms. Allocated memory was 155.2MB in the beginning and 597.7MB in the end (delta: 442.5MB). Free memory was 123.2MB in the beginning and 487.8MB in the end (delta: -364.5MB). Peak memory consumption was 80.1MB. Max. memory is 16.1GB. [2022-11-20 12:25:04,785 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:25:04,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 738.52ms. Allocated memory is still 155.2MB. Free memory was 123.2MB in the beginning and 97.3MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 12:25:04,786 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.62ms. Allocated memory is still 155.2MB. Free memory was 97.3MB in the beginning and 94.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 12:25:04,786 INFO L158 Benchmark]: Boogie Preprocessor took 55.53ms. Allocated memory is still 155.2MB. Free memory was 94.6MB in the beginning and 92.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:25:04,786 INFO L158 Benchmark]: RCFGBuilder took 1051.70ms. Allocated memory is still 155.2MB. Free memory was 92.2MB in the beginning and 110.1MB in the end (delta: -17.9MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2022-11-20 12:25:04,787 INFO L158 Benchmark]: TraceAbstraction took 40289.78ms. Allocated memory was 155.2MB in the beginning and 597.7MB in the end (delta: 442.5MB). Free memory was 109.1MB in the beginning and 488.8MB in the end (delta: -379.7MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2022-11-20 12:25:04,787 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 597.7MB. Free memory was 488.8MB in the beginning and 487.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:25:04,788 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.29ms. Allocated memory is still 117.4MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 738.52ms. Allocated memory is still 155.2MB. Free memory was 123.2MB in the beginning and 97.3MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.62ms. Allocated memory is still 155.2MB. Free memory was 97.3MB in the beginning and 94.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.53ms. Allocated memory is still 155.2MB. Free memory was 94.6MB in the beginning and 92.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1051.70ms. Allocated memory is still 155.2MB. Free memory was 92.2MB in the beginning and 110.1MB in the end (delta: -17.9MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * TraceAbstraction took 40289.78ms. Allocated memory was 155.2MB in the beginning and 597.7MB in the end (delta: 442.5MB). Free memory was 109.1MB in the beginning and 488.8MB in the end (delta: -379.7MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 597.7MB. Free memory was 488.8MB in the beginning and 487.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 132 PlacesBefore, 44 PlacesAfterwards, 124 TransitionsBefore, 35 TransitionsAfterwards, 2264 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 119 TotalNumberOfCompositions, 5891 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3034, independent: 2865, independent conditional: 0, independent unconditional: 2865, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1582, independent: 1526, independent conditional: 0, independent unconditional: 1526, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1582, independent: 1495, independent conditional: 0, independent unconditional: 1495, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 791, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 746, dependent conditional: 0, dependent unconditional: 746, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3034, independent: 1339, independent conditional: 0, independent unconditional: 1339, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 1582, unknown conditional: 0, unknown unconditional: 1582] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 168, Positive conditional cache size: 0, Positive unconditional cache size: 168, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-3, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=-2, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=-1, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L772] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 40.1s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1160 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1160 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 585 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3841 IncrementalHoareTripleChecker+Invalid, 4426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 585 mSolverCounterUnsat, 44 mSDtfsCounter, 3841 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1028occurred in iteration=0, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 836 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 21.5s InterpolantComputationTime, 419 NumberOfCodeBlocks, 419 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 371 ConstructedInterpolants, 0 QuantifiedInterpolants, 6405 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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 12:25:04,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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_d6b212ee-ddab-48c2-b726-551cc056acfb/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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:25:07,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:25:07,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:25:07,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:25:07,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:25:07,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:25:07,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:25:07,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:25:07,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:25:07,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:25:07,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:25:07,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:25:07,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:25:07,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:25:07,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:25:07,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:25:07,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:25:07,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:25:07,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:25:07,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:25:07,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:25:07,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:25:07,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:25:07,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:25:07,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:25:07,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:25:07,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:25:07,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:25:07,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:25:07,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:25:07,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:25:07,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:25:07,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:25:07,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:25:07,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:25:07,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:25:07,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:25:07,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:25:07,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:25:07,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:25:07,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:25:07,279 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-20 12:25:07,314 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:25:07,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:25:07,315 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:25:07,315 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:25:07,315 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:25:07,315 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:25:07,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:25:07,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:25:07,316 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:25:07,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:25:07,316 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:25:07,316 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:25:07,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:25:07,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:25:07,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:25:07,317 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 12:25:07,317 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 12:25:07,317 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 12:25:07,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:25:07,317 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 12:25:07,318 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 12:25:07,318 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 12:25:07,318 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:25:07,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:25:07,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:25:07,318 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:25:07,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:25:07,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:25:07,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:25:07,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:25:07,319 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 12:25:07,319 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 12:25:07,320 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 12:25:07,320 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_d6b212ee-ddab-48c2-b726-551cc056acfb/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_d6b212ee-ddab-48c2-b726-551cc056acfb/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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2022-11-20 12:25:07,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:25:07,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:25:07,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:25:07,722 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:25:07,723 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:25:07,730 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-20 12:25:11,026 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:25:11,468 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:25:11,469 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-20 12:25:11,486 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/data/6fd14bf12/78de04dc79b844af9624f823a1cc6ebb/FLAG2ca6935e0 [2022-11-20 12:25:11,509 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/data/6fd14bf12/78de04dc79b844af9624f823a1cc6ebb [2022-11-20 12:25:11,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:25:11,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:25:11,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:25:11,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:25:11,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:25:11,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:25:11" (1/1) ... [2022-11-20 12:25:11,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6c6c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:11, skipping insertion in model container [2022-11-20 12:25:11,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:25:11" (1/1) ... [2022-11-20 12:25:11,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:25:11,593 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:25:11,793 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_d6b212ee-ddab-48c2-b726-551cc056acfb/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-20 12:25:12,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:25:12,261 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:25:12,281 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_d6b212ee-ddab-48c2-b726-551cc056acfb/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-20 12:25:12,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:25:12,420 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:25:12,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:12 WrapperNode [2022-11-20 12:25:12,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:25:12,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:25:12,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:25:12,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:25:12,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:12" (1/1) ... [2022-11-20 12:25:12,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:12" (1/1) ... [2022-11-20 12:25:12,517 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-20 12:25:12,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:25:12,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:25:12,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:25:12,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:25:12,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:12" (1/1) ... [2022-11-20 12:25:12,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:12" (1/1) ... [2022-11-20 12:25:12,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:12" (1/1) ... [2022-11-20 12:25:12,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:12" (1/1) ... [2022-11-20 12:25:12,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:12" (1/1) ... [2022-11-20 12:25:12,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:12" (1/1) ... [2022-11-20 12:25:12,573 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:12" (1/1) ... [2022-11-20 12:25:12,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:12" (1/1) ... [2022-11-20 12:25:12,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:25:12,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:25:12,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:25:12,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:25:12,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:12" (1/1) ... [2022-11-20 12:25:12,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:25:12,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:25:12,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:25:12,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:25:12,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:25:12,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:25:12,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:25:12,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:25:12,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 12:25:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 12:25:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 12:25:12,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 12:25:12,738 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 12:25:12,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 12:25:12,739 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 12:25:12,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 12:25:12,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:25:12,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:25:12,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:25:12,742 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 12:25:12,991 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:25:13,006 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:25:13,640 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:25:13,957 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:25:13,957 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:25:13,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:25:13 BoogieIcfgContainer [2022-11-20 12:25:13,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:25:13,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:25:13,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:25:13,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:25:13,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:25:11" (1/3) ... [2022-11-20 12:25:13,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a02672e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:25:13, skipping insertion in model container [2022-11-20 12:25:13,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:12" (2/3) ... [2022-11-20 12:25:13,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a02672e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:25:13, skipping insertion in model container [2022-11-20 12:25:13,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:25:13" (3/3) ... [2022-11-20 12:25:13,978 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-20 12:25:14,002 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:25:14,003 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-20 12:25:14,003 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:25:14,080 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:25:14,121 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 12:25:14,139 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 125 transitions, 265 flow [2022-11-20 12:25:14,143 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 125 transitions, 265 flow [2022-11-20 12:25:14,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-11-20 12:25:14,216 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-11-20 12:25:14,216 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:25:14,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-20 12:25:14,227 INFO L119 LiptonReduction]: Number of co-enabled transitions 2264 [2022-11-20 12:25:24,739 INFO L134 LiptonReduction]: Checked pairs total: 5897 [2022-11-20 12:25:24,740 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-11-20 12:25:24,749 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-20 12:25:24,852 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:24,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:25:24,887 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;@4b46b117, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:25:24,887 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-20 12:25:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 12:25:24,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:24,900 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 12:25:24,900 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:24,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:24,906 INFO L85 PathProgramCache]: Analyzing trace with hash 596, now seen corresponding path program 1 times [2022-11-20 12:25:24,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:25:24,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223253685] [2022-11-20 12:25:24,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:24,921 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 12:25:24,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:25:24,923 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:24,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:25,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 12:25:25,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:25,022 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 12:25:25,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:25:25,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:25:25,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223253685] [2022-11-20 12:25:25,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223253685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:25,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:25,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 12:25:25,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864829930] [2022-11-20 12:25:25,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:25,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 12:25:25,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:25:25,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 12:25:25,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:25:25,062 INFO L87 Difference]: Start difference. First operand has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:25,256 INFO L93 Difference]: Finished difference Result 970 states and 3096 transitions. [2022-11-20 12:25:25,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 12:25:25,259 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 12:25:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:25,300 INFO L225 Difference]: With dead ends: 970 [2022-11-20 12:25:25,313 INFO L226 Difference]: Without dead ends: 970 [2022-11-20 12:25:25,316 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 12:25:25,327 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:25,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:25:25,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-11-20 12:25:25,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2022-11-20 12:25:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 965 states have (on average 3.2082901554404146) internal successors, (3096), 969 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3096 transitions. [2022-11-20 12:25:25,518 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3096 transitions. Word has length 1 [2022-11-20 12:25:25,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:25,520 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 3096 transitions. [2022-11-20 12:25:25,520 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 12:25:25,522 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3096 transitions. [2022-11-20 12:25:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 12:25:25,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:25,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:25,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:25,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:25,736 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:25,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1876469506, now seen corresponding path program 1 times [2022-11-20 12:25:25,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:25:25,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242658006] [2022-11-20 12:25:25,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:25,738 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 12:25:25,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:25:25,739 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:25,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:25,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:25:25,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:25,918 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 12:25:25,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:25:25,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:25:25,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242658006] [2022-11-20 12:25:25,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242658006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:25,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:25,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:25:25,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884646388] [2022-11-20 12:25:25,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:25,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:25:25,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:25:25,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:25:25,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:25:25,931 INFO L87 Difference]: Start difference. First operand 970 states and 3096 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:26,077 INFO L93 Difference]: Finished difference Result 802 states and 2518 transitions. [2022-11-20 12:25:26,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:25:26,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 12:25:26,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:26,089 INFO L225 Difference]: With dead ends: 802 [2022-11-20 12:25:26,089 INFO L226 Difference]: Without dead ends: 778 [2022-11-20 12:25:26,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:25:26,091 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:26,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:25:26,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-11-20 12:25:26,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2022-11-20 12:25:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 776 states have (on average 3.1649484536082473) internal successors, (2456), 777 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 2456 transitions. [2022-11-20 12:25:26,135 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 2456 transitions. Word has length 7 [2022-11-20 12:25:26,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:26,137 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 2456 transitions. [2022-11-20 12:25:26,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 2456 transitions. [2022-11-20 12:25:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 12:25:26,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:26,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:26,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:26,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:26,351 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:26,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:26,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1388116026, now seen corresponding path program 1 times [2022-11-20 12:25:26,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:25:26,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691016253] [2022-11-20 12:25:26,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:26,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:25:26,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:25:26,357 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:26,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:26,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:25:26,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:26,527 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 12:25:26,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:25:26,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:25:26,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691016253] [2022-11-20 12:25:26,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691016253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:26,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:26,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:25:26,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884298955] [2022-11-20 12:25:26,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:26,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:25:26,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:25:26,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:25:26,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:25:26,530 INFO L87 Difference]: Start difference. First operand 778 states and 2456 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:26,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:26,653 INFO L93 Difference]: Finished difference Result 478 states and 1256 transitions. [2022-11-20 12:25:26,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:25:26,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 12:25:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:26,657 INFO L225 Difference]: With dead ends: 478 [2022-11-20 12:25:26,658 INFO L226 Difference]: Without dead ends: 478 [2022-11-20 12:25:26,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:25:26,659 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:26,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:25:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-11-20 12:25:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2022-11-20 12:25:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 476 states have (on average 2.638655462184874) internal successors, (1256), 477 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1256 transitions. [2022-11-20 12:25:26,679 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1256 transitions. Word has length 10 [2022-11-20 12:25:26,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:26,679 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 1256 transitions. [2022-11-20 12:25:26,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1256 transitions. [2022-11-20 12:25:26,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 12:25:26,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:26,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:26,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:26,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:26,895 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:26,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:26,896 INFO L85 PathProgramCache]: Analyzing trace with hash 792412821, now seen corresponding path program 1 times [2022-11-20 12:25:26,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:25:26,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445258144] [2022-11-20 12:25:26,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:26,897 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 12:25:26,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:25:26,900 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:26,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:27,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:25:27,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:27,117 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 12:25:27,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:25:27,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:25:27,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445258144] [2022-11-20 12:25:27,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445258144] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:27,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:27,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:25:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881727183] [2022-11-20 12:25:27,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:27,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:25:27,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:25:27,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:25:27,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:25:27,122 INFO L87 Difference]: Start difference. First operand 478 states and 1256 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:27,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:27,315 INFO L93 Difference]: Finished difference Result 243 states and 551 transitions. [2022-11-20 12:25:27,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:25:27,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 12:25:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:27,320 INFO L225 Difference]: With dead ends: 243 [2022-11-20 12:25:27,320 INFO L226 Difference]: Without dead ends: 243 [2022-11-20 12:25:27,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:25:27,321 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:27,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:25:27,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-20 12:25:27,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2022-11-20 12:25:27,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 241 states have (on average 2.2863070539419086) internal successors, (551), 242 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 551 transitions. [2022-11-20 12:25:27,333 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 551 transitions. Word has length 13 [2022-11-20 12:25:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:27,334 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 551 transitions. [2022-11-20 12:25:27,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:27,334 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 551 transitions. [2022-11-20 12:25:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 12:25:27,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:27,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:27,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:27,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:27,551 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:27,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:27,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1604027536, now seen corresponding path program 1 times [2022-11-20 12:25:27,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:25:27,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654417290] [2022-11-20 12:25:27,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:27,553 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 12:25:27,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:25:27,554 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:27,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:27,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 12:25:27,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:27,771 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 12:25:27,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:25:27,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:25:27,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654417290] [2022-11-20 12:25:27,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654417290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:27,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:27,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:25:27,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853427354] [2022-11-20 12:25:27,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:27,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:25:27,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:25:27,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:25:27,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:25:27,807 INFO L87 Difference]: Start difference. First operand 243 states and 551 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:28,058 INFO L93 Difference]: Finished difference Result 183 states and 431 transitions. [2022-11-20 12:25:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:25:28,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 12:25:28,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:28,060 INFO L225 Difference]: With dead ends: 183 [2022-11-20 12:25:28,060 INFO L226 Difference]: Without dead ends: 183 [2022-11-20 12:25:28,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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 12:25:28,061 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 28 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:28,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 9 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:25:28,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-20 12:25:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-20 12:25:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 181 states have (on average 2.3812154696132595) internal successors, (431), 182 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 431 transitions. [2022-11-20 12:25:28,069 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 431 transitions. Word has length 17 [2022-11-20 12:25:28,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:28,069 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 431 transitions. [2022-11-20 12:25:28,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:28,070 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 431 transitions. [2022-11-20 12:25:28,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:25:28,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:28,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:28,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:28,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:28,285 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:28,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:28,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1756408, now seen corresponding path program 1 times [2022-11-20 12:25:28,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:25:28,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358252868] [2022-11-20 12:25:28,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:28,287 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 12:25:28,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:25:28,289 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:28,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:28,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 12:25:28,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:29,030 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 12:25:29,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:25:29,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:25:29,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358252868] [2022-11-20 12:25:29,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358252868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:29,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:29,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:25:29,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422860229] [2022-11-20 12:25:29,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:29,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:25:29,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:25:29,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:25:29,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:25:29,032 INFO L87 Difference]: Start difference. First operand 183 states and 431 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:29,126 INFO L93 Difference]: Finished difference Result 182 states and 430 transitions. [2022-11-20 12:25:29,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:25:29,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 12:25:29,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:29,129 INFO L225 Difference]: With dead ends: 182 [2022-11-20 12:25:29,129 INFO L226 Difference]: Without dead ends: 182 [2022-11-20 12:25:29,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:25:29,130 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 11 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:29,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2022-11-20 12:25:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-20 12:25:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-11-20 12:25:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.3756906077348066) internal successors, (430), 181 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 430 transitions. [2022-11-20 12:25:29,138 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 430 transitions. Word has length 22 [2022-11-20 12:25:29,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:29,138 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 430 transitions. [2022-11-20 12:25:29,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 430 transitions. [2022-11-20 12:25:29,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:25:29,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:29,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:29,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:29,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:29,340 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:29,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1756432, now seen corresponding path program 1 times [2022-11-20 12:25:29,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:25:29,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830558737] [2022-11-20 12:25:29,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:29,341 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 12:25:29,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:25:29,343 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:29,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:29,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 12:25:29,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:29,833 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 12:25:29,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:25:29,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:25:29,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830558737] [2022-11-20 12:25:29,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830558737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:29,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:29,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:25:29,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219877957] [2022-11-20 12:25:29,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:29,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:25:29,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:25:29,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:25:29,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:25:29,836 INFO L87 Difference]: Start difference. First operand 182 states and 430 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:30,066 INFO L93 Difference]: Finished difference Result 259 states and 592 transitions. [2022-11-20 12:25:30,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:25:30,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 12:25:30,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:30,068 INFO L225 Difference]: With dead ends: 259 [2022-11-20 12:25:30,068 INFO L226 Difference]: Without dead ends: 240 [2022-11-20 12:25:30,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:25:30,069 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 36 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:30,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:25:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-11-20 12:25:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 174. [2022-11-20 12:25:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 2.346820809248555) internal successors, (406), 173 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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 12:25:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 406 transitions. [2022-11-20 12:25:30,079 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 406 transitions. Word has length 22 [2022-11-20 12:25:30,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:30,079 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 406 transitions. [2022-11-20 12:25:30,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 406 transitions. [2022-11-20 12:25:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:25:30,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:30,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:30,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:30,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:30,282 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:30,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:30,282 INFO L85 PathProgramCache]: Analyzing trace with hash -294484922, now seen corresponding path program 2 times [2022-11-20 12:25:30,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:25:30,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685384492] [2022-11-20 12:25:30,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:25:30,283 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 12:25:30,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:25:30,284 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:30,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:30,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 12:25:30,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:25:30,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 12:25:30,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:30,754 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 12:25:30,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:25:30,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:25:30,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685384492] [2022-11-20 12:25:30,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685384492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:30,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:30,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:25:30,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640987829] [2022-11-20 12:25:30,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:30,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:25:30,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:25:30,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:25:30,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:25:30,758 INFO L87 Difference]: Start difference. First operand 174 states and 406 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:31,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:31,173 INFO L93 Difference]: Finished difference Result 265 states and 580 transitions. [2022-11-20 12:25:31,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:25:31,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 12:25:31,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:31,175 INFO L225 Difference]: With dead ends: 265 [2022-11-20 12:25:31,175 INFO L226 Difference]: Without dead ends: 183 [2022-11-20 12:25:31,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:25:31,176 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 60 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:31,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 14 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:25:31,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-20 12:25:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 162. [2022-11-20 12:25:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.2422360248447206) internal successors, (361), 161 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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 12:25:31,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 361 transitions. [2022-11-20 12:25:31,184 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 361 transitions. Word has length 22 [2022-11-20 12:25:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:31,185 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 361 transitions. [2022-11-20 12:25:31,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 361 transitions. [2022-11-20 12:25:31,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:25:31,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:31,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:31,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:31,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:31,401 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:31,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:31,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2030453012, now seen corresponding path program 3 times [2022-11-20 12:25:31,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:25:31,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499320271] [2022-11-20 12:25:31,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:25:31,401 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 12:25:31,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:25:31,402 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:31,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:31,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 12:25:31,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:25:31,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 12:25:31,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:32,007 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 12:25:32,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:25:32,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:25:32,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499320271] [2022-11-20 12:25:32,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499320271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:32,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:32,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:25:32,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783410807] [2022-11-20 12:25:32,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:32,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:25:32,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:25:32,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:25:32,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:25:32,011 INFO L87 Difference]: Start difference. First operand 162 states and 361 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:32,346 INFO L93 Difference]: Finished difference Result 277 states and 591 transitions. [2022-11-20 12:25:32,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:25:32,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 12:25:32,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:32,347 INFO L225 Difference]: With dead ends: 277 [2022-11-20 12:25:32,348 INFO L226 Difference]: Without dead ends: 175 [2022-11-20 12:25:32,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:25:32,348 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 45 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:32,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 10 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:25:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-20 12:25:32,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 154. [2022-11-20 12:25:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.1633986928104574) internal successors, (331), 153 states have internal predecessors, (331), 0 states have call successors, (0), 0 states 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 12:25:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 331 transitions. [2022-11-20 12:25:32,354 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 331 transitions. Word has length 22 [2022-11-20 12:25:32,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:32,354 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 331 transitions. [2022-11-20 12:25:32,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 331 transitions. [2022-11-20 12:25:32,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:25:32,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:32,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:32,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:32,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:32,556 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:32,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:32,556 INFO L85 PathProgramCache]: Analyzing trace with hash 255157846, now seen corresponding path program 4 times [2022-11-20 12:25:32,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:25:32,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995315374] [2022-11-20 12:25:32,557 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 12:25:32,557 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 12:25:32,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:25:32,558 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:32,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:32,722 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 12:25:32,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:25:32,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 12:25:32,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:32,974 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 12:25:32,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:25:32,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:25:32,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995315374] [2022-11-20 12:25:32,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995315374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:32,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:32,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:25:32,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497277887] [2022-11-20 12:25:32,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:32,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:25:32,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:25:32,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:25:32,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:25:32,978 INFO L87 Difference]: Start difference. First operand 154 states and 331 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:33,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:33,328 INFO L93 Difference]: Finished difference Result 246 states and 508 transitions. [2022-11-20 12:25:33,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:25:33,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 12:25:33,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:33,330 INFO L225 Difference]: With dead ends: 246 [2022-11-20 12:25:33,330 INFO L226 Difference]: Without dead ends: 189 [2022-11-20 12:25:33,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:25:33,331 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:33,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 5 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:25:33,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-20 12:25:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 152. [2022-11-20 12:25:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.1456953642384105) internal successors, (324), 151 states have internal predecessors, (324), 0 states have call successors, (0), 0 states 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 12:25:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 324 transitions. [2022-11-20 12:25:33,338 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 324 transitions. Word has length 22 [2022-11-20 12:25:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:33,338 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 324 transitions. [2022-11-20 12:25:33,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:33,338 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 324 transitions. [2022-11-20 12:25:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:25:33,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:33,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:33,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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)] Forceful destruction successful, exit code 0 [2022-11-20 12:25:33,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:33,565 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:33,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash -632315622, now seen corresponding path program 5 times [2022-11-20 12:25:33,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:25:33,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966246644] [2022-11-20 12:25:33,566 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 12:25:33,566 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 12:25:33,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:25:33,568 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:33,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:33,744 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 12:25:33,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:25:33,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 12:25:33,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:34,206 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 12:25:34,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:25:34,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:25:34,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966246644] [2022-11-20 12:25:34,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966246644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:34,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:34,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:25:34,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896097621] [2022-11-20 12:25:34,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:34,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:25:34,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:25:34,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:25:34,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:25:34,210 INFO L87 Difference]: Start difference. First operand 152 states and 324 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:34,536 INFO L93 Difference]: Finished difference Result 233 states and 477 transitions. [2022-11-20 12:25:34,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:25:34,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 12:25:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:34,538 INFO L225 Difference]: With dead ends: 233 [2022-11-20 12:25:34,538 INFO L226 Difference]: Without dead ends: 189 [2022-11-20 12:25:34,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 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 12:25:34,539 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:34,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 5 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:25:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-20 12:25:34,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 160. [2022-11-20 12:25:34,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 2.1132075471698113) internal successors, (336), 159 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 336 transitions. [2022-11-20 12:25:34,545 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 336 transitions. Word has length 22 [2022-11-20 12:25:34,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:34,545 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 336 transitions. [2022-11-20 12:25:34,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:34,545 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 336 transitions. [2022-11-20 12:25:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:25:34,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:34,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:34,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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)] Ended with exit code 0 [2022-11-20 12:25:34,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:34,761 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:34,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:34,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1625556312, now seen corresponding path program 6 times [2022-11-20 12:25:34,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:25:34,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823655334] [2022-11-20 12:25:34,761 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 12:25:34,761 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 12:25:34,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:25:34,762 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:34,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:34,943 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-11-20 12:25:34,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:25:34,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 12:25:34,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:35,260 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 12:25:35,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:25:35,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:25:35,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823655334] [2022-11-20 12:25:35,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823655334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:35,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:35,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:25:35,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580503562] [2022-11-20 12:25:35,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:35,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:25:35,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:25:35,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:25:35,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:25:35,263 INFO L87 Difference]: Start difference. First operand 160 states and 336 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:35,566 INFO L93 Difference]: Finished difference Result 200 states and 405 transitions. [2022-11-20 12:25:35,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:25:35,567 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 12:25:35,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:35,568 INFO L225 Difference]: With dead ends: 200 [2022-11-20 12:25:35,569 INFO L226 Difference]: Without dead ends: 141 [2022-11-20 12:25:35,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 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 12:25:35,570 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:35,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:25:35,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-20 12:25:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 120. [2022-11-20 12:25:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 2.0840336134453783) internal successors, (248), 119 states have internal predecessors, (248), 0 states have call successors, (0), 0 states 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 12:25:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 248 transitions. [2022-11-20 12:25:35,578 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 248 transitions. Word has length 22 [2022-11-20 12:25:35,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:35,578 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 248 transitions. [2022-11-20 12:25:35,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:35,578 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 248 transitions. [2022-11-20 12:25:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:25:35,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:35,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:35,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:35,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:35,783 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:35,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:35,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1806317994, now seen corresponding path program 7 times [2022-11-20 12:25:35,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:25:35,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934434702] [2022-11-20 12:25:35,784 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 12:25:35,784 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 12:25:35,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:25:35,786 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:35,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 (14)] Waiting until timeout for monitored process [2022-11-20 12:25:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:35,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-20 12:25:35,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:36,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 12:25:36,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:25:36,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:25:36,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934434702] [2022-11-20 12:25:36,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934434702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:36,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:36,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:25:36,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311050599] [2022-11-20 12:25:36,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:36,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:25:36,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:25:36,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:25:36,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:25:36,550 INFO L87 Difference]: Start difference. First operand 120 states and 248 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:37,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:37,072 INFO L93 Difference]: Finished difference Result 155 states and 313 transitions. [2022-11-20 12:25:37,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:25:37,073 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 12:25:37,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:37,075 INFO L225 Difference]: With dead ends: 155 [2022-11-20 12:25:37,075 INFO L226 Difference]: Without dead ends: 128 [2022-11-20 12:25:37,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-11-20 12:25:37,076 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 49 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:37,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 10 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:25:37,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-20 12:25:37,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2022-11-20 12:25:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.0521739130434784) internal successors, (236), 115 states have internal predecessors, (236), 0 states have call successors, (0), 0 states 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 12:25:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 236 transitions. [2022-11-20 12:25:37,082 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 236 transitions. Word has length 22 [2022-11-20 12:25:37,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:37,082 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 236 transitions. [2022-11-20 12:25:37,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 236 transitions. [2022-11-20 12:25:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:25:37,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:37,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:37,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 (14)] Forceful destruction successful, exit code 0 [2022-11-20 12:25:37,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:37,297 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:37,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:37,297 INFO L85 PathProgramCache]: Analyzing trace with hash 855941620, now seen corresponding path program 8 times [2022-11-20 12:25:37,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:25:37,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877628613] [2022-11-20 12:25:37,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:25:37,298 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 12:25:37,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:25:37,300 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:37,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 (15)] Waiting until timeout for monitored process [2022-11-20 12:25:37,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 12:25:37,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:25:37,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 12:25:37,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:37,895 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 12:25:37,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:25:37,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:25:37,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877628613] [2022-11-20 12:25:37,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877628613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:37,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:37,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:25:37,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127503855] [2022-11-20 12:25:37,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:37,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:25:37,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:25:37,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:25:37,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:25:37,899 INFO L87 Difference]: Start difference. First operand 116 states and 236 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:38,214 INFO L93 Difference]: Finished difference Result 131 states and 259 transitions. [2022-11-20 12:25:38,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:25:38,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 12:25:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:38,215 INFO L225 Difference]: With dead ends: 131 [2022-11-20 12:25:38,215 INFO L226 Difference]: Without dead ends: 108 [2022-11-20 12:25:38,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:25:38,216 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:38,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 4 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:25:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-20 12:25:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2022-11-20 12:25:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.0210526315789474) internal successors, (192), 95 states have internal predecessors, (192), 0 states have call successors, (0), 0 states 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 12:25:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 192 transitions. [2022-11-20 12:25:38,220 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 192 transitions. Word has length 22 [2022-11-20 12:25:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:38,221 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 192 transitions. [2022-11-20 12:25:38,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:25:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 192 transitions. [2022-11-20 12:25:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:25:38,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:38,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:38,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 (15)] Forceful destruction successful, exit code 0 [2022-11-20 12:25:38,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:38,424 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 12:25:38,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:38,425 INFO L85 PathProgramCache]: Analyzing trace with hash -480953962, now seen corresponding path program 9 times [2022-11-20 12:25:38,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:25:38,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051271908] [2022-11-20 12:25:38,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:25:38,426 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 12:25:38,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:25:38,427 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:38,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 (16)] Waiting until timeout for monitored process [2022-11-20 12:25:38,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 12:25:38,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 12:25:38,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:25:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:25:38,752 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-20 12:25:38,752 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:25:38,753 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-20 12:25:38,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-20 12:25:38,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-20 12:25:38,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-20 12:25:38,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-20 12:25:38,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-20 12:25:38,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-20 12:25:38,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-20 12:25:38,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-20 12:25:38,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-20 12:25:38,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-20 12:25:38,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-20 12:25:38,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-20 12:25:38,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 (16)] Forceful destruction successful, exit code 0 [2022-11-20 12:25:38,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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 12:25:38,983 INFO L444 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:38,989 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 12:25:38,989 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:25:39,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:25:39 BasicIcfg [2022-11-20 12:25:39,125 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:25:39,126 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:25:39,126 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:25:39,126 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:25:39,127 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:25:13" (3/4) ... [2022-11-20 12:25:39,130 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 12:25:39,133 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:25:39,134 INFO L158 Benchmark]: Toolchain (without parser) took 27620.47ms. Allocated memory was 73.4MB in the beginning and 192.9MB in the end (delta: 119.5MB). Free memory was 49.4MB in the beginning and 150.8MB in the end (delta: -101.4MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2022-11-20 12:25:39,134 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 73.4MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:25:39,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 906.93ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 49.3MB in the beginning and 71.6MB in the end (delta: -22.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 12:25:39,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.38ms. Allocated memory is still 104.9MB. Free memory was 71.6MB in the beginning and 69.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:25:39,136 INFO L158 Benchmark]: Boogie Preprocessor took 81.11ms. Allocated memory is still 104.9MB. Free memory was 69.2MB in the beginning and 66.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:25:39,137 INFO L158 Benchmark]: RCFGBuilder took 1364.18ms. Allocated memory is still 104.9MB. Free memory was 66.7MB in the beginning and 68.6MB in the end (delta: -1.9MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2022-11-20 12:25:39,137 INFO L158 Benchmark]: TraceAbstraction took 25158.18ms. Allocated memory was 104.9MB in the beginning and 192.9MB in the end (delta: 88.1MB). Free memory was 68.4MB in the beginning and 151.9MB in the end (delta: -83.4MB). Peak memory consumption was 103.2MB. Max. memory is 16.1GB. [2022-11-20 12:25:39,137 INFO L158 Benchmark]: Witness Printer took 7.09ms. Allocated memory is still 192.9MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:25:39,139 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.33ms. Allocated memory is still 73.4MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 906.93ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 49.3MB in the beginning and 71.6MB in the end (delta: -22.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.38ms. Allocated memory is still 104.9MB. Free memory was 71.6MB in the beginning and 69.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.11ms. Allocated memory is still 104.9MB. Free memory was 69.2MB in the beginning and 66.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1364.18ms. Allocated memory is still 104.9MB. Free memory was 66.7MB in the beginning and 68.6MB in the end (delta: -1.9MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * TraceAbstraction took 25158.18ms. Allocated memory was 104.9MB in the beginning and 192.9MB in the end (delta: 88.1MB). Free memory was 68.4MB in the beginning and 151.9MB in the end (delta: -83.4MB). Peak memory consumption was 103.2MB. Max. memory is 16.1GB. * Witness Printer took 7.09ms. Allocated memory is still 192.9MB. Free memory is still 150.8MB. 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: 10.6s, 133 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 35 TransitionsAfterwards, 2264 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 5897 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3161, independent: 2992, independent conditional: 0, independent unconditional: 2992, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1603, independent: 1547, independent conditional: 0, independent unconditional: 1547, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1603, independent: 1516, independent conditional: 0, independent unconditional: 1516, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 778, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 723, dependent conditional: 0, dependent unconditional: 723, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3161, independent: 1445, independent conditional: 0, independent unconditional: 1445, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 1603, unknown conditional: 0, unknown unconditional: 1603] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 185, Positive conditional cache size: 0, Positive unconditional cache size: 185, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=0, t2537={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=1, t2537={-6:0}, t2538={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=2, t2537={-6:0}, t2538={-10:0}, t2539={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L772] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={-6:0}, t2538={-10:0}, t2539={-2:0}, weak$$choice0=4, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 24.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 390 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 390 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 31 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1764 IncrementalHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 23 mSDtfsCounter, 1764 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 170 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1028occurred in iteration=0, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 219 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 232 ConstructedInterpolants, 17 QuantifiedInterpolants, 2416 SizeOfPredicates, 28 NumberOfNonLiveVariables, 2200 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 12:25:39,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b212ee-ddab-48c2-b726-551cc056acfb/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