./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe009_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 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_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe009_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a --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 be536b3b382c4e63adbabc11deb06983f35dbd290b78e0d42f1a068990873986 --- 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-b5237d8 [2022-11-21 16:56:39,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:56:39,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:56:39,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:56:39,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:56:39,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:56:39,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:56:39,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:56:39,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:56:39,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:56:39,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:56:39,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:56:39,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:56:39,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:56:39,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:56:39,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:56:39,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:56:39,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:56:39,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:56:39,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:56:39,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:56:39,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:56:39,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:56:39,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:56:39,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:56:39,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:56:39,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:56:39,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:56:39,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:56:39,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:56:39,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:56:39,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:56:39,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:56:39,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:56:39,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:56:39,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:56:39,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:56:39,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:56:39,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:56:39,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:56:39,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:56:39,913 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 16:56:39,937 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:56:39,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:56:39,938 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:56:39,938 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:56:39,939 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:56:39,939 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:56:39,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:56:39,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:56:39,940 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:56:39,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:56:39,941 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:56:39,941 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:56:39,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:56:39,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:56:39,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:56:39,942 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:56:39,942 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:56:39,942 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:56:39,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:56:39,943 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:56:39,943 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:56:39,943 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:56:39,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:56:39,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:56:39,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:56:39,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:56:39,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:56:39,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:56:39,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:56:39,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:56:39,945 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_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/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_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a 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 -> be536b3b382c4e63adbabc11deb06983f35dbd290b78e0d42f1a068990873986 [2022-11-21 16:56:40,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:56:40,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:56:40,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:56:40,321 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:56:40,322 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:56:40,323 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe009_power.opt.i [2022-11-21 16:56:43,446 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:56:43,734 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:56:43,734 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/sv-benchmarks/c/pthread-wmm/safe009_power.opt.i [2022-11-21 16:56:43,756 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/data/544ec473d/e36da205dd2543459adf4af2cc87b452/FLAGad9cf4afc [2022-11-21 16:56:43,774 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/data/544ec473d/e36da205dd2543459adf4af2cc87b452 [2022-11-21 16:56:43,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:56:43,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:56:43,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:56:43,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:56:43,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:56:43,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:56:43" (1/1) ... [2022-11-21 16:56:43,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1036ba77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:56:43, skipping insertion in model container [2022-11-21 16:56:43,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:56:43" (1/1) ... [2022-11-21 16:56:43,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:56:43,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:56:44,035 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_598a4185-fe29-4b10-918f-c9bca8e9e4eb/sv-benchmarks/c/pthread-wmm/safe009_power.opt.i[951,964] [2022-11-21 16:56:44,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:56:44,320 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:56:44,336 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_598a4185-fe29-4b10-918f-c9bca8e9e4eb/sv-benchmarks/c/pthread-wmm/safe009_power.opt.i[951,964] [2022-11-21 16:56:44,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:56:44,478 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:56:44,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:56:44 WrapperNode [2022-11-21 16:56:44,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:56:44,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:56:44,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:56:44,483 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:56:44,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:56:44" (1/1) ... [2022-11-21 16:56:44,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:56:44" (1/1) ... [2022-11-21 16:56:44,580 INFO L138 Inliner]: procedures = 176, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2022-11-21 16:56:44,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:56:44,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:56:44,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:56:44,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:56:44,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:56:44" (1/1) ... [2022-11-21 16:56:44,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:56:44" (1/1) ... [2022-11-21 16:56:44,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:56:44" (1/1) ... [2022-11-21 16:56:44,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:56:44" (1/1) ... [2022-11-21 16:56:44,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:56:44" (1/1) ... [2022-11-21 16:56:44,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:56:44" (1/1) ... [2022-11-21 16:56:44,642 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:56:44" (1/1) ... [2022-11-21 16:56:44,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:56:44" (1/1) ... [2022-11-21 16:56:44,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:56:44,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:56:44,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:56:44,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:56:44,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:56:44" (1/1) ... [2022-11-21 16:56:44,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:56:44,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:56:44,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:56:44,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:56:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:56:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:56:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:56:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:56:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:56:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:56:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 16:56:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 16:56:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 16:56:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 16:56:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 16:56:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 16:56:44,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:56:44,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:56:44,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:56:44,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:56:44,754 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:56:44,971 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:56:44,981 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:56:45,754 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:56:46,546 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:56:46,546 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:56:46,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:56:46 BoogieIcfgContainer [2022-11-21 16:56:46,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:56:46,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:56:46,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:56:46,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:56:46,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:56:43" (1/3) ... [2022-11-21 16:56:46,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d119b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:56:46, skipping insertion in model container [2022-11-21 16:56:46,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:56:44" (2/3) ... [2022-11-21 16:56:46,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d119b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:56:46, skipping insertion in model container [2022-11-21 16:56:46,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:56:46" (3/3) ... [2022-11-21 16:56:46,559 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_power.opt.i [2022-11-21 16:56:46,580 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:56:46,580 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2022-11-21 16:56:46,581 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:56:46,721 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:56:46,770 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 16:56:46,791 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 176 transitions, 367 flow [2022-11-21 16:56:46,796 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 176 transitions, 367 flow [2022-11-21 16:56:46,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 176 transitions, 367 flow [2022-11-21 16:56:46,931 INFO L130 PetriNetUnfolder]: 2/173 cut-off events. [2022-11-21 16:56:46,931 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:56:46,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 2/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 239 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-11-21 16:56:46,945 INFO L119 LiptonReduction]: Number of co-enabled transitions 6462 [2022-11-21 16:57:06,670 INFO L134 LiptonReduction]: Checked pairs total: 31792 [2022-11-21 16:57:06,670 INFO L136 LiptonReduction]: Total number of compositions: 152 [2022-11-21 16:57:06,678 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 72 transitions, 159 flow [2022-11-21 16:57:07,836 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 31296 states, 25361 states have (on average 4.56180749970427) internal successors, (115692), 31295 states have internal predecessors, (115692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:07,855 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:57:07,862 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;@1c29e3bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:57:07,862 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2022-11-21 16:57:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 31296 states, 25361 states have (on average 4.56180749970427) internal successors, (115692), 31295 states have internal predecessors, (115692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:07,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 16:57:07,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:07,956 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 16:57:07,957 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:07,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:07,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1155, now seen corresponding path program 1 times [2022-11-21 16:57:07,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:07,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328477487] [2022-11-21 16:57:07,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:07,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:57:08,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:08,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328477487] [2022-11-21 16:57:08,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328477487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:08,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:08,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 16:57:08,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618743075] [2022-11-21 16:57:08,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:08,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:57:08,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:08,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:57:08,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:57:08,378 INFO L87 Difference]: Start difference. First operand has 31296 states, 25361 states have (on average 4.56180749970427) internal successors, (115692), 31295 states have internal predecessors, (115692), 0 states have call successors, (0), 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-21 16:57:08,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:08,881 INFO L93 Difference]: Finished difference Result 13554 states and 48704 transitions. [2022-11-21 16:57:08,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:57:08,883 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-21 16:57:08,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:09,065 INFO L225 Difference]: With dead ends: 13554 [2022-11-21 16:57:09,065 INFO L226 Difference]: Without dead ends: 13554 [2022-11-21 16:57:09,066 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-21 16:57:09,070 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:09,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:57:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13554 states. [2022-11-21 16:57:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13554 to 13554. [2022-11-21 16:57:09,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 11665 states have (on average 4.175225032147449) internal successors, (48704), 13553 states have internal predecessors, (48704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 48704 transitions. [2022-11-21 16:57:09,950 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 48704 transitions. Word has length 1 [2022-11-21 16:57:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:09,950 INFO L495 AbstractCegarLoop]: Abstraction has 13554 states and 48704 transitions. [2022-11-21 16:57:09,951 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-21 16:57:09,951 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 48704 transitions. [2022-11-21 16:57:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 16:57:09,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:09,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 16:57:09,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:57:09,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:09,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:09,953 INFO L85 PathProgramCache]: Analyzing trace with hash 35407789, now seen corresponding path program 1 times [2022-11-21 16:57:09,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:09,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805400759] [2022-11-21 16:57:09,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:09,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:10,298 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-21 16:57:10,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:10,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805400759] [2022-11-21 16:57:10,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805400759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:10,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:10,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:57:10,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757283607] [2022-11-21 16:57:10,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:10,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:57:10,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:10,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:57:10,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:57:10,308 INFO L87 Difference]: Start difference. First operand 13554 states and 48704 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:10,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:10,809 INFO L93 Difference]: Finished difference Result 12198 states and 43695 transitions. [2022-11-21 16:57:10,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:57:10,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-21 16:57:10,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:10,905 INFO L225 Difference]: With dead ends: 12198 [2022-11-21 16:57:10,906 INFO L226 Difference]: Without dead ends: 12198 [2022-11-21 16:57:10,913 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-21 16:57:10,914 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:10,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:57:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12198 states. [2022-11-21 16:57:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12198 to 12198. [2022-11-21 16:57:11,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12198 states, 10624 states have (on average 4.112857680722891) internal successors, (43695), 12197 states have internal predecessors, (43695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12198 states to 12198 states and 43695 transitions. [2022-11-21 16:57:11,434 INFO L78 Accepts]: Start accepts. Automaton has 12198 states and 43695 transitions. Word has length 4 [2022-11-21 16:57:11,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:11,434 INFO L495 AbstractCegarLoop]: Abstraction has 12198 states and 43695 transitions. [2022-11-21 16:57:11,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 12198 states and 43695 transitions. [2022-11-21 16:57:11,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 16:57:11,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:11,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 16:57:11,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:57:11,437 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:11,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:11,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1097642414, now seen corresponding path program 1 times [2022-11-21 16:57:11,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:11,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623338408] [2022-11-21 16:57:11,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:11,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:11,544 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-21 16:57:11,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:11,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623338408] [2022-11-21 16:57:11,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623338408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:11,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:11,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:57:11,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713559464] [2022-11-21 16:57:11,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:11,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:57:11,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:11,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:57:11,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:57:11,547 INFO L87 Difference]: Start difference. First operand 12198 states and 43695 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:11,895 INFO L93 Difference]: Finished difference Result 8695 states and 28420 transitions. [2022-11-21 16:57:11,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:57:11,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-21 16:57:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:11,946 INFO L225 Difference]: With dead ends: 8695 [2022-11-21 16:57:11,946 INFO L226 Difference]: Without dead ends: 8695 [2022-11-21 16:57:11,947 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-21 16:57:11,950 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:11,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:57:11,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8695 states. [2022-11-21 16:57:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8695 to 7807. [2022-11-21 16:57:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7807 states, 7278 states have (on average 3.7427864798021435) internal successors, (27240), 7806 states have internal predecessors, (27240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7807 states to 7807 states and 27240 transitions. [2022-11-21 16:57:12,372 INFO L78 Accepts]: Start accepts. Automaton has 7807 states and 27240 transitions. Word has length 5 [2022-11-21 16:57:12,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:12,373 INFO L495 AbstractCegarLoop]: Abstraction has 7807 states and 27240 transitions. [2022-11-21 16:57:12,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 7807 states and 27240 transitions. [2022-11-21 16:57:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 16:57:12,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:12,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 16:57:12,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:57:12,375 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:12,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:12,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1097642415, now seen corresponding path program 1 times [2022-11-21 16:57:12,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:12,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68860770] [2022-11-21 16:57:12,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:12,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:12,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-21 16:57:12,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:12,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68860770] [2022-11-21 16:57:12,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68860770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:12,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:12,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:57:12,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62304103] [2022-11-21 16:57:12,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:12,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:57:12,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:12,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:57:12,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:57:12,549 INFO L87 Difference]: Start difference. First operand 7807 states and 27240 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:12,874 INFO L93 Difference]: Finished difference Result 9994 states and 35106 transitions. [2022-11-21 16:57:12,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:57:12,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-21 16:57:12,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:12,945 INFO L225 Difference]: With dead ends: 9994 [2022-11-21 16:57:12,945 INFO L226 Difference]: Without dead ends: 9994 [2022-11-21 16:57:12,946 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-21 16:57:12,949 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:12,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:57:12,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9994 states. [2022-11-21 16:57:13,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9994 to 8768. [2022-11-21 16:57:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8768 states, 8243 states have (on average 3.8691010554409804) internal successors, (31893), 8767 states have internal predecessors, (31893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8768 states to 8768 states and 31893 transitions. [2022-11-21 16:57:13,408 INFO L78 Accepts]: Start accepts. Automaton has 8768 states and 31893 transitions. Word has length 5 [2022-11-21 16:57:13,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:13,409 INFO L495 AbstractCegarLoop]: Abstraction has 8768 states and 31893 transitions. [2022-11-21 16:57:13,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:13,410 INFO L276 IsEmpty]: Start isEmpty. Operand 8768 states and 31893 transitions. [2022-11-21 16:57:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 16:57:13,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:13,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 16:57:13,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:57:13,412 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:13,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1097642417, now seen corresponding path program 1 times [2022-11-21 16:57:13,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:13,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140142639] [2022-11-21 16:57:13,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:13,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:13,603 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-21 16:57:13,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:13,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140142639] [2022-11-21 16:57:13,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140142639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:13,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:13,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:57:13,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328280985] [2022-11-21 16:57:13,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:13,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:57:13,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:13,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:57:13,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:57:13,609 INFO L87 Difference]: Start difference. First operand 8768 states and 31893 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:13,733 INFO L93 Difference]: Finished difference Result 3348 states and 10727 transitions. [2022-11-21 16:57:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:57:13,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-21 16:57:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:13,750 INFO L225 Difference]: With dead ends: 3348 [2022-11-21 16:57:13,751 INFO L226 Difference]: Without dead ends: 3244 [2022-11-21 16:57:13,751 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-21 16:57:13,752 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:13,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:57:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3244 states. [2022-11-21 16:57:13,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3244 to 3090. [2022-11-21 16:57:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3090 states, 3016 states have (on average 3.2997347480106103) internal successors, (9952), 3089 states have internal predecessors, (9952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 9952 transitions. [2022-11-21 16:57:13,950 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 9952 transitions. Word has length 5 [2022-11-21 16:57:13,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:13,951 INFO L495 AbstractCegarLoop]: Abstraction has 3090 states and 9952 transitions. [2022-11-21 16:57:13,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:13,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 9952 transitions. [2022-11-21 16:57:13,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 16:57:13,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:13,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:13,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:57:13,953 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:13,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:13,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1246582098, now seen corresponding path program 1 times [2022-11-21 16:57:13,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:13,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818379310] [2022-11-21 16:57:13,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:13,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:57:14,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:14,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818379310] [2022-11-21 16:57:14,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818379310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:14,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:14,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:57:14,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886451430] [2022-11-21 16:57:14,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:14,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:57:14,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:14,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:57:14,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:57:14,102 INFO L87 Difference]: Start difference. First operand 3090 states and 9952 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:14,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:14,239 INFO L93 Difference]: Finished difference Result 3050 states and 9810 transitions. [2022-11-21 16:57:14,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:57:14,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 16:57:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:14,254 INFO L225 Difference]: With dead ends: 3050 [2022-11-21 16:57:14,254 INFO L226 Difference]: Without dead ends: 3050 [2022-11-21 16:57:14,254 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-21 16:57:14,255 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:14,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:57:14,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3050 states. [2022-11-21 16:57:14,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3050 to 3050. [2022-11-21 16:57:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3050 states, 2976 states have (on average 3.2963709677419355) internal successors, (9810), 3049 states have internal predecessors, (9810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:14,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 9810 transitions. [2022-11-21 16:57:14,344 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 9810 transitions. Word has length 10 [2022-11-21 16:57:14,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:14,345 INFO L495 AbstractCegarLoop]: Abstraction has 3050 states and 9810 transitions. [2022-11-21 16:57:14,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:14,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 9810 transitions. [2022-11-21 16:57:14,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:57:14,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:14,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:14,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:57:14,347 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:14,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:14,348 INFO L85 PathProgramCache]: Analyzing trace with hash 12321016, now seen corresponding path program 1 times [2022-11-21 16:57:14,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:14,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999918146] [2022-11-21 16:57:14,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:14,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:14,642 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-21 16:57:14,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:14,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999918146] [2022-11-21 16:57:14,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999918146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:14,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:14,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:57:14,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647903890] [2022-11-21 16:57:14,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:14,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:57:14,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:14,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:57:14,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:57:14,645 INFO L87 Difference]: Start difference. First operand 3050 states and 9810 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:15,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:15,008 INFO L93 Difference]: Finished difference Result 4078 states and 12856 transitions. [2022-11-21 16:57:15,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:57:15,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-21 16:57:15,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:15,028 INFO L225 Difference]: With dead ends: 4078 [2022-11-21 16:57:15,029 INFO L226 Difference]: Without dead ends: 4078 [2022-11-21 16:57:15,029 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-21 16:57:15,030 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 46 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:15,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:57:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4078 states. [2022-11-21 16:57:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4078 to 3250. [2022-11-21 16:57:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 3176 states have (on average 3.3123425692695214) internal successors, (10520), 3249 states have internal predecessors, (10520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 10520 transitions. [2022-11-21 16:57:15,136 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 10520 transitions. Word has length 11 [2022-11-21 16:57:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:15,136 INFO L495 AbstractCegarLoop]: Abstraction has 3250 states and 10520 transitions. [2022-11-21 16:57:15,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 10520 transitions. [2022-11-21 16:57:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:57:15,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:15,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:15,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:57:15,139 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:15,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:15,139 INFO L85 PathProgramCache]: Analyzing trace with hash 12321017, now seen corresponding path program 1 times [2022-11-21 16:57:15,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:15,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934252648] [2022-11-21 16:57:15,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:15,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:15,622 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-21 16:57:15,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:15,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934252648] [2022-11-21 16:57:15,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934252648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:15,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:15,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:57:15,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684083590] [2022-11-21 16:57:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:15,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:57:15,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:15,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:57:15,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:57:15,626 INFO L87 Difference]: Start difference. First operand 3250 states and 10520 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:15,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:15,830 INFO L93 Difference]: Finished difference Result 5110 states and 16428 transitions. [2022-11-21 16:57:15,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:57:15,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-21 16:57:15,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:15,853 INFO L225 Difference]: With dead ends: 5110 [2022-11-21 16:57:15,853 INFO L226 Difference]: Without dead ends: 5110 [2022-11-21 16:57:15,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:57:15,854 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 58 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:15,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:57:15,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5110 states. [2022-11-21 16:57:16,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5110 to 3250. [2022-11-21 16:57:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 3176 states have (on average 3.287153652392947) internal successors, (10440), 3249 states have internal predecessors, (10440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 10440 transitions. [2022-11-21 16:57:16,061 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 10440 transitions. Word has length 11 [2022-11-21 16:57:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:16,062 INFO L495 AbstractCegarLoop]: Abstraction has 3250 states and 10440 transitions. [2022-11-21 16:57:16,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 10440 transitions. [2022-11-21 16:57:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:57:16,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:16,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:16,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:57:16,064 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:16,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:16,064 INFO L85 PathProgramCache]: Analyzing trace with hash 10656233, now seen corresponding path program 1 times [2022-11-21 16:57:16,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:16,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846294203] [2022-11-21 16:57:16,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:16,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:16,251 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-21 16:57:16,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:16,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846294203] [2022-11-21 16:57:16,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846294203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:16,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:16,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:57:16,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829682680] [2022-11-21 16:57:16,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:16,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:57:16,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:16,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:57:16,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:57:16,258 INFO L87 Difference]: Start difference. First operand 3250 states and 10440 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:16,411 INFO L93 Difference]: Finished difference Result 3240 states and 10400 transitions. [2022-11-21 16:57:16,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:57:16,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-21 16:57:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:16,428 INFO L225 Difference]: With dead ends: 3240 [2022-11-21 16:57:16,428 INFO L226 Difference]: Without dead ends: 3240 [2022-11-21 16:57:16,428 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-21 16:57:16,430 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:16,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:57:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3240 states. [2022-11-21 16:57:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3240 to 3240. [2022-11-21 16:57:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3240 states, 3166 states have (on average 3.2849020846493997) internal successors, (10400), 3239 states have internal predecessors, (10400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3240 states to 3240 states and 10400 transitions. [2022-11-21 16:57:16,563 INFO L78 Accepts]: Start accepts. Automaton has 3240 states and 10400 transitions. Word has length 11 [2022-11-21 16:57:16,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:16,564 INFO L495 AbstractCegarLoop]: Abstraction has 3240 states and 10400 transitions. [2022-11-21 16:57:16,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 10400 transitions. [2022-11-21 16:57:16,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:57:16,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:16,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:16,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:57:16,570 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:16,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:16,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1272862724, now seen corresponding path program 2 times [2022-11-21 16:57:16,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:16,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384585316] [2022-11-21 16:57:16,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:16,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:17,147 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-21 16:57:17,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:17,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384585316] [2022-11-21 16:57:17,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384585316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:17,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:17,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:57:17,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548616301] [2022-11-21 16:57:17,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:17,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:57:17,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:17,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:57:17,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:57:17,150 INFO L87 Difference]: Start difference. First operand 3240 states and 10400 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-21 16:57:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:17,444 INFO L93 Difference]: Finished difference Result 3636 states and 11368 transitions. [2022-11-21 16:57:17,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:57:17,445 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-21 16:57:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:17,456 INFO L225 Difference]: With dead ends: 3636 [2022-11-21 16:57:17,456 INFO L226 Difference]: Without dead ends: 3636 [2022-11-21 16:57:17,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:57:17,457 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 52 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:17,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 4 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:57:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3636 states. [2022-11-21 16:57:17,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3636 to 3160. [2022-11-21 16:57:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3160 states, 3087 states have (on average 3.2834467120181405) internal successors, (10136), 3159 states have internal predecessors, (10136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3160 states to 3160 states and 10136 transitions. [2022-11-21 16:57:17,587 INFO L78 Accepts]: Start accepts. Automaton has 3160 states and 10136 transitions. Word has length 11 [2022-11-21 16:57:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:17,587 INFO L495 AbstractCegarLoop]: Abstraction has 3160 states and 10136 transitions. [2022-11-21 16:57:17,587 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-21 16:57:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3160 states and 10136 transitions. [2022-11-21 16:57:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:57:17,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:17,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:17,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:57:17,589 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:17,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:17,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1272862723, now seen corresponding path program 2 times [2022-11-21 16:57:17,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:17,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013214709] [2022-11-21 16:57:17,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:17,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:57:18,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:18,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013214709] [2022-11-21 16:57:18,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013214709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:18,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:18,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:57:18,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270309964] [2022-11-21 16:57:18,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:18,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:57:18,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:18,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:57:18,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:57:18,185 INFO L87 Difference]: Start difference. First operand 3160 states and 10136 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-21 16:57:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:18,590 INFO L93 Difference]: Finished difference Result 4861 states and 15206 transitions. [2022-11-21 16:57:18,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:57:18,591 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-21 16:57:18,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:18,612 INFO L225 Difference]: With dead ends: 4861 [2022-11-21 16:57:18,612 INFO L226 Difference]: Without dead ends: 4861 [2022-11-21 16:57:18,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:57:18,613 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 84 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:18,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 6 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:57:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4861 states. [2022-11-21 16:57:18,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4861 to 3060. [2022-11-21 16:57:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 2987 states have (on average 3.2758620689655173) internal successors, (9785), 3059 states have internal predecessors, (9785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 9785 transitions. [2022-11-21 16:57:18,745 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 9785 transitions. Word has length 11 [2022-11-21 16:57:18,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:18,745 INFO L495 AbstractCegarLoop]: Abstraction has 3060 states and 9785 transitions. [2022-11-21 16:57:18,745 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-21 16:57:18,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 9785 transitions. [2022-11-21 16:57:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 16:57:18,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:18,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:18,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:57:18,747 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:18,748 INFO L85 PathProgramCache]: Analyzing trace with hash 330499007, now seen corresponding path program 1 times [2022-11-21 16:57:18,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:18,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763684930] [2022-11-21 16:57:18,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:18,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:18,925 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-21 16:57:18,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:18,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763684930] [2022-11-21 16:57:18,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763684930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:18,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:18,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:57:18,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014631352] [2022-11-21 16:57:18,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:18,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:57:18,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:18,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:57:18,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:57:18,928 INFO L87 Difference]: Start difference. First operand 3060 states and 9785 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:19,067 INFO L93 Difference]: Finished difference Result 3042 states and 9722 transitions. [2022-11-21 16:57:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:57:19,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-21 16:57:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:19,080 INFO L225 Difference]: With dead ends: 3042 [2022-11-21 16:57:19,081 INFO L226 Difference]: Without dead ends: 3042 [2022-11-21 16:57:19,082 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-21 16:57:19,083 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:19,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:57:19,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2022-11-21 16:57:19,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 3042. [2022-11-21 16:57:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3042 states, 2969 states have (on average 3.274503199730549) internal successors, (9722), 3041 states have internal predecessors, (9722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 9722 transitions. [2022-11-21 16:57:19,186 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 9722 transitions. Word has length 12 [2022-11-21 16:57:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:19,186 INFO L495 AbstractCegarLoop]: Abstraction has 3042 states and 9722 transitions. [2022-11-21 16:57:19,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 9722 transitions. [2022-11-21 16:57:19,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 16:57:19,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:19,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:19,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 16:57:19,189 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:19,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:19,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1444669687, now seen corresponding path program 1 times [2022-11-21 16:57:19,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:19,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145264426] [2022-11-21 16:57:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:19,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:57:20,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:20,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145264426] [2022-11-21 16:57:20,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145264426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:20,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:20,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:57:20,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110990849] [2022-11-21 16:57:20,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:20,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:57:20,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:20,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:57:20,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:57:20,126 INFO L87 Difference]: Start difference. First operand 3042 states and 9722 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-21 16:57:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:20,757 INFO L93 Difference]: Finished difference Result 5299 states and 16223 transitions. [2022-11-21 16:57:20,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:57:20,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-21 16:57:20,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:20,775 INFO L225 Difference]: With dead ends: 5299 [2022-11-21 16:57:20,775 INFO L226 Difference]: Without dead ends: 5299 [2022-11-21 16:57:20,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:57:20,776 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 108 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:20,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 9 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:57:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2022-11-21 16:57:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 3030. [2022-11-21 16:57:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3030 states, 2957 states have (on average 3.261751775448089) internal successors, (9645), 3029 states have internal predecessors, (9645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 9645 transitions. [2022-11-21 16:57:20,909 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 9645 transitions. Word has length 13 [2022-11-21 16:57:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:20,909 INFO L495 AbstractCegarLoop]: Abstraction has 3030 states and 9645 transitions. [2022-11-21 16:57:20,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-21 16:57:20,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 9645 transitions. [2022-11-21 16:57:20,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 16:57:20,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:20,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:20,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:57:20,912 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:20,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:20,912 INFO L85 PathProgramCache]: Analyzing trace with hash 407357890, now seen corresponding path program 1 times [2022-11-21 16:57:20,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:20,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582954553] [2022-11-21 16:57:20,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:20,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:21,173 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-21 16:57:21,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:21,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582954553] [2022-11-21 16:57:21,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582954553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:21,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:21,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:57:21,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553449764] [2022-11-21 16:57:21,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:21,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:57:21,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:21,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:57:21,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:57:21,176 INFO L87 Difference]: Start difference. First operand 3030 states and 9645 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:21,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:21,309 INFO L93 Difference]: Finished difference Result 3018 states and 9601 transitions. [2022-11-21 16:57:21,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:57:21,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 16:57:21,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:21,320 INFO L225 Difference]: With dead ends: 3018 [2022-11-21 16:57:21,320 INFO L226 Difference]: Without dead ends: 3018 [2022-11-21 16:57:21,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:57:21,320 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:21,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:57:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2022-11-21 16:57:21,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3018. [2022-11-21 16:57:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3018 states, 2945 states have (on average 3.260101867572156) internal successors, (9601), 3017 states have internal predecessors, (9601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 9601 transitions. [2022-11-21 16:57:21,396 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 9601 transitions. Word has length 13 [2022-11-21 16:57:21,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:21,397 INFO L495 AbstractCegarLoop]: Abstraction has 3018 states and 9601 transitions. [2022-11-21 16:57:21,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 9601 transitions. [2022-11-21 16:57:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 16:57:21,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:21,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:21,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:57:21,399 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:21,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1650739150, now seen corresponding path program 1 times [2022-11-21 16:57:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:21,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358212510] [2022-11-21 16:57:21,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:21,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:21,541 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-21 16:57:21,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:21,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358212510] [2022-11-21 16:57:21,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358212510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:21,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:21,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:57:21,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071105444] [2022-11-21 16:57:21,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:21,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:57:21,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:21,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:57:21,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:57:21,544 INFO L87 Difference]: Start difference. First operand 3018 states and 9601 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:21,733 INFO L93 Difference]: Finished difference Result 2822 states and 8535 transitions. [2022-11-21 16:57:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:57:21,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 16:57:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:21,744 INFO L225 Difference]: With dead ends: 2822 [2022-11-21 16:57:21,744 INFO L226 Difference]: Without dead ends: 2822 [2022-11-21 16:57:21,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:57:21,746 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 49 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:21,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 5 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:57:21,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2022-11-21 16:57:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2522. [2022-11-21 16:57:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 2449 states have (on average 3.2245814618211517) internal successors, (7897), 2521 states have internal predecessors, (7897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 7897 transitions. [2022-11-21 16:57:21,809 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 7897 transitions. Word has length 13 [2022-11-21 16:57:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:21,810 INFO L495 AbstractCegarLoop]: Abstraction has 2522 states and 7897 transitions. [2022-11-21 16:57:21,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 7897 transitions. [2022-11-21 16:57:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:57:21,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:21,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:21,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:57:21,812 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:21,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:21,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1866507221, now seen corresponding path program 1 times [2022-11-21 16:57:21,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:21,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060456911] [2022-11-21 16:57:21,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:22,574 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-21 16:57:22,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:22,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060456911] [2022-11-21 16:57:22,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060456911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:22,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:22,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:57:22,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521937650] [2022-11-21 16:57:22,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:22,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:57:22,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:22,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:57:22,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:57:22,577 INFO L87 Difference]: Start difference. First operand 2522 states and 7897 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-21 16:57:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:23,231 INFO L93 Difference]: Finished difference Result 3058 states and 9071 transitions. [2022-11-21 16:57:23,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:57:23,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-21 16:57:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:23,238 INFO L225 Difference]: With dead ends: 3058 [2022-11-21 16:57:23,238 INFO L226 Difference]: Without dead ends: 3058 [2022-11-21 16:57:23,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-11-21 16:57:23,239 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 196 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:23,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 6 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:57:23,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2022-11-21 16:57:23,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2264. [2022-11-21 16:57:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2264 states, 2192 states have (on average 3.2445255474452557) internal successors, (7112), 2263 states have internal predecessors, (7112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 7112 transitions. [2022-11-21 16:57:23,302 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 7112 transitions. Word has length 14 [2022-11-21 16:57:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:23,302 INFO L495 AbstractCegarLoop]: Abstraction has 2264 states and 7112 transitions. [2022-11-21 16:57:23,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-21 16:57:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 7112 transitions. [2022-11-21 16:57:23,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:57:23,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:23,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:23,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 16:57:23,304 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:23,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:23,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1315805878, now seen corresponding path program 1 times [2022-11-21 16:57:23,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:23,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133358642] [2022-11-21 16:57:23,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:23,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:23,481 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-21 16:57:23,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:23,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133358642] [2022-11-21 16:57:23,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133358642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:23,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:23,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:57:23,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133247038] [2022-11-21 16:57:23,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:23,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:57:23,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:23,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:57:23,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:57:23,484 INFO L87 Difference]: Start difference. First operand 2264 states and 7112 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:23,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:23,621 INFO L93 Difference]: Finished difference Result 3267 states and 10142 transitions. [2022-11-21 16:57:23,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:57:23,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 16:57:23,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:23,632 INFO L225 Difference]: With dead ends: 3267 [2022-11-21 16:57:23,632 INFO L226 Difference]: Without dead ends: 3267 [2022-11-21 16:57:23,632 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-21 16:57:23,633 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:23,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:57:23,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3267 states. [2022-11-21 16:57:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3267 to 2396. [2022-11-21 16:57:23,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2324 states have (on average 3.2362306368330467) internal successors, (7521), 2395 states have internal predecessors, (7521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 7521 transitions. [2022-11-21 16:57:23,703 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 7521 transitions. Word has length 14 [2022-11-21 16:57:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:23,703 INFO L495 AbstractCegarLoop]: Abstraction has 2396 states and 7521 transitions. [2022-11-21 16:57:23,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 7521 transitions. [2022-11-21 16:57:23,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:57:23,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:23,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:23,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 16:57:23,706 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:23,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:23,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1338239462, now seen corresponding path program 1 times [2022-11-21 16:57:23,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:23,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308128633] [2022-11-21 16:57:23,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:23,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:23,898 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-21 16:57:23,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:23,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308128633] [2022-11-21 16:57:23,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308128633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:23,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:23,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:57:23,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736322768] [2022-11-21 16:57:23,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:23,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:57:23,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:23,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:57:23,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:57:23,900 INFO L87 Difference]: Start difference. First operand 2396 states and 7521 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:24,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:24,075 INFO L93 Difference]: Finished difference Result 4252 states and 13276 transitions. [2022-11-21 16:57:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:57:24,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 16:57:24,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:24,088 INFO L225 Difference]: With dead ends: 4252 [2022-11-21 16:57:24,089 INFO L226 Difference]: Without dead ends: 4252 [2022-11-21 16:57:24,089 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-21 16:57:24,090 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 54 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:24,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:57:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4252 states. [2022-11-21 16:57:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4252 to 2549. [2022-11-21 16:57:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2549 states, 2477 states have (on average 3.233750504642713) internal successors, (8010), 2548 states have internal predecessors, (8010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 8010 transitions. [2022-11-21 16:57:24,172 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 8010 transitions. Word has length 14 [2022-11-21 16:57:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:24,172 INFO L495 AbstractCegarLoop]: Abstraction has 2549 states and 8010 transitions. [2022-11-21 16:57:24,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 8010 transitions. [2022-11-21 16:57:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:57:24,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:24,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:24,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 16:57:24,175 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:24,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1983962624, now seen corresponding path program 2 times [2022-11-21 16:57:24,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:24,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655979238] [2022-11-21 16:57:24,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:24,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:25,425 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-21 16:57:25,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:25,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655979238] [2022-11-21 16:57:25,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655979238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:25,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:25,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:57:25,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534623630] [2022-11-21 16:57:25,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:25,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:57:25,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:25,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:57:25,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:57:25,427 INFO L87 Difference]: Start difference. First operand 2549 states and 8010 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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-21 16:57:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:26,059 INFO L93 Difference]: Finished difference Result 2857 states and 9048 transitions. [2022-11-21 16:57:26,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:57:26,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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-21 16:57:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:26,068 INFO L225 Difference]: With dead ends: 2857 [2022-11-21 16:57:26,068 INFO L226 Difference]: Without dead ends: 2857 [2022-11-21 16:57:26,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:57:26,069 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 74 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:26,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 10 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:57:26,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2022-11-21 16:57:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2569. [2022-11-21 16:57:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2497 states have (on average 3.2346816179415296) internal successors, (8077), 2568 states have internal predecessors, (8077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 8077 transitions. [2022-11-21 16:57:26,135 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 8077 transitions. Word has length 14 [2022-11-21 16:57:26,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:26,137 INFO L495 AbstractCegarLoop]: Abstraction has 2569 states and 8077 transitions. [2022-11-21 16:57:26,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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-21 16:57:26,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 8077 transitions. [2022-11-21 16:57:26,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:57:26,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:26,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:26,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 16:57:26,140 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:26,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:26,140 INFO L85 PathProgramCache]: Analyzing trace with hash -366694018, now seen corresponding path program 1 times [2022-11-21 16:57:26,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:26,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405550482] [2022-11-21 16:57:26,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:26,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:57:26,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:26,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405550482] [2022-11-21 16:57:26,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405550482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:26,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:26,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:57:26,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564006915] [2022-11-21 16:57:26,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:26,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:57:26,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:26,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:57:26,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:57:26,393 INFO L87 Difference]: Start difference. First operand 2569 states and 8077 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-21 16:57:26,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:26,606 INFO L93 Difference]: Finished difference Result 2355 states and 6656 transitions. [2022-11-21 16:57:26,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:57:26,607 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-21 16:57:26,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:26,613 INFO L225 Difference]: With dead ends: 2355 [2022-11-21 16:57:26,613 INFO L226 Difference]: Without dead ends: 2355 [2022-11-21 16:57:26,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:57:26,614 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 89 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:26,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 6 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:57:26,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2022-11-21 16:57:26,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 2123. [2022-11-21 16:57:26,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2123 states, 2051 states have (on average 2.9731838127742565) internal successors, (6098), 2122 states have internal predecessors, (6098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 6098 transitions. [2022-11-21 16:57:26,663 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 6098 transitions. Word has length 14 [2022-11-21 16:57:26,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:26,664 INFO L495 AbstractCegarLoop]: Abstraction has 2123 states and 6098 transitions. [2022-11-21 16:57:26,664 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-21 16:57:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 6098 transitions. [2022-11-21 16:57:26,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:57:26,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:26,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:26,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 16:57:26,666 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:26,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:26,667 INFO L85 PathProgramCache]: Analyzing trace with hash -366693968, now seen corresponding path program 1 times [2022-11-21 16:57:26,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:26,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020941316] [2022-11-21 16:57:26,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:26,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:27,264 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-21 16:57:27,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:27,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020941316] [2022-11-21 16:57:27,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020941316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:27,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:27,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:57:27,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995939636] [2022-11-21 16:57:27,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:27,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:57:27,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:27,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:57:27,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:57:27,266 INFO L87 Difference]: Start difference. First operand 2123 states and 6098 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-21 16:57:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:27,960 INFO L93 Difference]: Finished difference Result 2857 states and 8574 transitions. [2022-11-21 16:57:27,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:57:27,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-21 16:57:27,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:27,968 INFO L225 Difference]: With dead ends: 2857 [2022-11-21 16:57:27,968 INFO L226 Difference]: Without dead ends: 2809 [2022-11-21 16:57:27,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:57:27,969 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 85 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:27,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 25 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 16:57:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2022-11-21 16:57:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2766. [2022-11-21 16:57:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2766 states, 2703 states have (on average 3.0617832038475767) internal successors, (8276), 2765 states have internal predecessors, (8276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:28,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 8276 transitions. [2022-11-21 16:57:28,033 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 8276 transitions. Word has length 14 [2022-11-21 16:57:28,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:28,034 INFO L495 AbstractCegarLoop]: Abstraction has 2766 states and 8276 transitions. [2022-11-21 16:57:28,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-21 16:57:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 8276 transitions. [2022-11-21 16:57:28,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 16:57:28,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:28,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:28,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 16:57:28,038 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:28,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:28,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1371043835, now seen corresponding path program 1 times [2022-11-21 16:57:28,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:28,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474812482] [2022-11-21 16:57:28,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:28,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:30,058 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-21 16:57:30,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:30,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474812482] [2022-11-21 16:57:30,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474812482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:30,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:30,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:57:30,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731561108] [2022-11-21 16:57:30,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:30,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:57:30,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:30,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:57:30,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:57:30,060 INFO L87 Difference]: Start difference. First operand 2766 states and 8276 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-21 16:57:30,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:30,794 INFO L93 Difference]: Finished difference Result 3046 states and 9146 transitions. [2022-11-21 16:57:30,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:57:30,795 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-21 16:57:30,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:30,803 INFO L225 Difference]: With dead ends: 3046 [2022-11-21 16:57:30,803 INFO L226 Difference]: Without dead ends: 3046 [2022-11-21 16:57:30,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:57:30,804 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:30,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 9 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:57:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3046 states. [2022-11-21 16:57:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3046 to 2786. [2022-11-21 16:57:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2786 states, 2723 states have (on average 3.0605949320602277) internal successors, (8334), 2785 states have internal predecessors, (8334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 8334 transitions. [2022-11-21 16:57:30,871 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 8334 transitions. Word has length 15 [2022-11-21 16:57:30,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:30,871 INFO L495 AbstractCegarLoop]: Abstraction has 2786 states and 8334 transitions. [2022-11-21 16:57:30,871 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-21 16:57:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 8334 transitions. [2022-11-21 16:57:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 16:57:30,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:30,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:30,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 16:57:30,878 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:30,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:30,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2013349205, now seen corresponding path program 1 times [2022-11-21 16:57:30,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:30,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252768532] [2022-11-21 16:57:30,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:30,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:31,142 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-21 16:57:31,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:31,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252768532] [2022-11-21 16:57:31,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252768532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:31,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:31,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:57:31,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906182664] [2022-11-21 16:57:31,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:31,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:57:31,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:31,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:57:31,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:57:31,145 INFO L87 Difference]: Start difference. First operand 2786 states and 8334 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-21 16:57:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:31,247 INFO L93 Difference]: Finished difference Result 1548 states and 3981 transitions. [2022-11-21 16:57:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:57:31,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-21 16:57:31,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:31,251 INFO L225 Difference]: With dead ends: 1548 [2022-11-21 16:57:31,251 INFO L226 Difference]: Without dead ends: 1548 [2022-11-21 16:57:31,252 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-21 16:57:31,253 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:31,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:57:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2022-11-21 16:57:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1541. [2022-11-21 16:57:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1498 states have (on average 2.643524699599466) internal successors, (3960), 1540 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 3960 transitions. [2022-11-21 16:57:31,283 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 3960 transitions. Word has length 15 [2022-11-21 16:57:31,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:31,283 INFO L495 AbstractCegarLoop]: Abstraction has 1541 states and 3960 transitions. [2022-11-21 16:57:31,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-21 16:57:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 3960 transitions. [2022-11-21 16:57:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:57:31,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:31,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:31,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-21 16:57:31,288 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:31,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:31,289 INFO L85 PathProgramCache]: Analyzing trace with hash -194120825, now seen corresponding path program 1 times [2022-11-21 16:57:31,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:31,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722013908] [2022-11-21 16:57:31,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:31,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:31,602 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-21 16:57:31,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:31,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722013908] [2022-11-21 16:57:31,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722013908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:31,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:31,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:57:31,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793331054] [2022-11-21 16:57:31,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:31,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:57:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:31,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:57:31,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:57:31,608 INFO L87 Difference]: Start difference. First operand 1541 states and 3960 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:31,736 INFO L93 Difference]: Finished difference Result 728 states and 1631 transitions. [2022-11-21 16:57:31,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:57:31,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 16:57:31,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:31,738 INFO L225 Difference]: With dead ends: 728 [2022-11-21 16:57:31,738 INFO L226 Difference]: Without dead ends: 728 [2022-11-21 16:57:31,738 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-21 16:57:31,739 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:31,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 3 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:57:31,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-11-21 16:57:31,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 708. [2022-11-21 16:57:31,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 693 states have (on average 2.2813852813852815) internal successors, (1581), 707 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1581 transitions. [2022-11-21 16:57:31,753 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1581 transitions. Word has length 17 [2022-11-21 16:57:31,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:31,754 INFO L495 AbstractCegarLoop]: Abstraction has 708 states and 1581 transitions. [2022-11-21 16:57:31,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1581 transitions. [2022-11-21 16:57:31,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:57:31,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:31,757 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-21 16:57:31,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-21 16:57:31,757 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:31,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:31,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1636838118, now seen corresponding path program 1 times [2022-11-21 16:57:31,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:31,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954505024] [2022-11-21 16:57:31,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:31,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:32,028 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-21 16:57:32,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:32,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954505024] [2022-11-21 16:57:32,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954505024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:32,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:32,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:57:32,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978810938] [2022-11-21 16:57:32,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:32,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:57:32,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:32,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:57:32,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:57:32,032 INFO L87 Difference]: Start difference. First operand 708 states and 1581 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-21 16:57:32,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:32,265 INFO L93 Difference]: Finished difference Result 1217 states and 2492 transitions. [2022-11-21 16:57:32,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:57:32,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-21 16:57:32,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:32,268 INFO L225 Difference]: With dead ends: 1217 [2022-11-21 16:57:32,268 INFO L226 Difference]: Without dead ends: 1201 [2022-11-21 16:57:32,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-21 16:57:32,269 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 43 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:32,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 2 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:57:32,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-11-21 16:57:32,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 620. [2022-11-21 16:57:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 605 states have (on average 2.2611570247933885) internal successors, (1368), 619 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1368 transitions. [2022-11-21 16:57:32,289 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1368 transitions. Word has length 19 [2022-11-21 16:57:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:32,289 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 1368 transitions. [2022-11-21 16:57:32,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-21 16:57:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1368 transitions. [2022-11-21 16:57:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:57:32,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:32,291 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-21 16:57:32,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-21 16:57:32,291 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:32,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:32,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1927388386, now seen corresponding path program 2 times [2022-11-21 16:57:32,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:32,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48999421] [2022-11-21 16:57:32,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:32,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:35,076 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-21 16:57:35,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:35,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48999421] [2022-11-21 16:57:35,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48999421] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:35,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:35,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:57:35,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883502934] [2022-11-21 16:57:35,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:35,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 16:57:35,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:35,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 16:57:35,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:57:35,079 INFO L87 Difference]: Start difference. First operand 620 states and 1368 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-21 16:57:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:35,905 INFO L93 Difference]: Finished difference Result 712 states and 1576 transitions. [2022-11-21 16:57:35,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:57:35,905 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-21 16:57:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:35,906 INFO L225 Difference]: With dead ends: 712 [2022-11-21 16:57:35,906 INFO L226 Difference]: Without dead ends: 712 [2022-11-21 16:57:35,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:57:35,907 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 119 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:35,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 9 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:57:35,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-11-21 16:57:35,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 631. [2022-11-21 16:57:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 616 states have (on average 2.2548701298701297) internal successors, (1389), 630 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1389 transitions. [2022-11-21 16:57:35,921 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1389 transitions. Word has length 19 [2022-11-21 16:57:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:35,921 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 1389 transitions. [2022-11-21 16:57:35,922 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-21 16:57:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1389 transitions. [2022-11-21 16:57:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:57:35,923 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:35,923 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-21 16:57:35,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-21 16:57:35,924 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:35,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:35,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1162376138, now seen corresponding path program 1 times [2022-11-21 16:57:35,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:35,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520454714] [2022-11-21 16:57:35,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:35,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:36,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-21 16:57:36,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:36,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520454714] [2022-11-21 16:57:36,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520454714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:57:36,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:57:36,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:57:36,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622295084] [2022-11-21 16:57:36,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:57:36,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:57:36,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:57:36,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:57:36,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:57:36,263 INFO L87 Difference]: Start difference. First operand 631 states and 1389 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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-21 16:57:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:36,385 INFO L93 Difference]: Finished difference Result 449 states and 1029 transitions. [2022-11-21 16:57:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:57:36,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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-21 16:57:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:36,386 INFO L225 Difference]: With dead ends: 449 [2022-11-21 16:57:36,386 INFO L226 Difference]: Without dead ends: 298 [2022-11-21 16:57:36,387 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-21 16:57:36,387 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 63 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:36,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 3 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:57:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-21 16:57:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 278. [2022-11-21 16:57:36,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 276 states have (on average 2.1956521739130435) internal successors, (606), 277 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 606 transitions. [2022-11-21 16:57:36,394 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 606 transitions. Word has length 19 [2022-11-21 16:57:36,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:36,394 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 606 transitions. [2022-11-21 16:57:36,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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-21 16:57:36,395 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 606 transitions. [2022-11-21 16:57:36,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:57:36,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:36,396 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-21 16:57:36,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-21 16:57:36,396 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:57:36,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:36,396 INFO L85 PathProgramCache]: Analyzing trace with hash -637101547, now seen corresponding path program 1 times [2022-11-21 16:57:36,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:36,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154974025] [2022-11-21 16:57:36,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:36,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:57:36,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:57:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:57:36,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:57:36,665 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:57:36,666 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2022-11-21 16:57:36,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2022-11-21 16:57:36,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2022-11-21 16:57:36,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2022-11-21 16:57:36,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2022-11-21 16:57:36,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2022-11-21 16:57:36,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2022-11-21 16:57:36,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2022-11-21 16:57:36,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2022-11-21 16:57:36,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2022-11-21 16:57:36,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2022-11-21 16:57:36,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2022-11-21 16:57:36,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2022-11-21 16:57:36,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2022-11-21 16:57:36,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2022-11-21 16:57:36,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2022-11-21 16:57:36,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2022-11-21 16:57:36,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2022-11-21 16:57:36,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2022-11-21 16:57:36,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2022-11-21 16:57:36,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2022-11-21 16:57:36,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2022-11-21 16:57:36,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2022-11-21 16:57:36,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2022-11-21 16:57:36,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2022-11-21 16:57:36,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2022-11-21 16:57:36,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2022-11-21 16:57:36,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2022-11-21 16:57:36,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2022-11-21 16:57:36,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2022-11-21 16:57:36,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2022-11-21 16:57:36,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2022-11-21 16:57:36,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2022-11-21 16:57:36,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2022-11-21 16:57:36,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2022-11-21 16:57:36,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2022-11-21 16:57:36,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2022-11-21 16:57:36,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2022-11-21 16:57:36,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2022-11-21 16:57:36,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2022-11-21 16:57:36,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2022-11-21 16:57:36,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2022-11-21 16:57:36,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2022-11-21 16:57:36,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2022-11-21 16:57:36,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2022-11-21 16:57:36,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2022-11-21 16:57:36,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2022-11-21 16:57:36,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2022-11-21 16:57:36,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2022-11-21 16:57:36,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2022-11-21 16:57:36,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2022-11-21 16:57:36,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2022-11-21 16:57:36,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2022-11-21 16:57:36,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2022-11-21 16:57:36,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2022-11-21 16:57:36,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2022-11-21 16:57:36,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2022-11-21 16:57:36,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2022-11-21 16:57:36,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2022-11-21 16:57:36,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2022-11-21 16:57:36,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2022-11-21 16:57:36,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2022-11-21 16:57:36,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2022-11-21 16:57:36,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2022-11-21 16:57:36,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2022-11-21 16:57:36,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2022-11-21 16:57:36,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2022-11-21 16:57:36,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2022-11-21 16:57:36,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2022-11-21 16:57:36,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2022-11-21 16:57:36,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2022-11-21 16:57:36,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2022-11-21 16:57:36,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2022-11-21 16:57:36,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2022-11-21 16:57:36,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2022-11-21 16:57:36,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-21 16:57:36,686 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:36,691 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 16:57:36,691 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:57:36,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:57:36 BasicIcfg [2022-11-21 16:57:36,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:57:36,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:57:36,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:57:36,765 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:57:36,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:56:46" (3/4) ... [2022-11-21 16:57:36,769 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 16:57:36,769 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:57:36,769 INFO L158 Benchmark]: Toolchain (without parser) took 52989.48ms. Allocated memory was 169.9MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 121.8MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 619.4MB. Max. memory is 16.1GB. [2022-11-21 16:57:36,778 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 169.9MB. Free memory is still 142.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:57:36,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 696.58ms. Allocated memory is still 169.9MB. Free memory was 121.6MB in the beginning and 97.3MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-21 16:57:36,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.61ms. Allocated memory is still 169.9MB. Free memory was 97.3MB in the beginning and 94.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:57:36,779 INFO L158 Benchmark]: Boogie Preprocessor took 73.80ms. Allocated memory is still 169.9MB. Free memory was 94.6MB in the beginning and 92.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:57:36,779 INFO L158 Benchmark]: RCFGBuilder took 1893.72ms. Allocated memory was 169.9MB in the beginning and 234.9MB in the end (delta: 65.0MB). Free memory was 92.1MB in the beginning and 146.7MB in the end (delta: -54.5MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2022-11-21 16:57:36,779 INFO L158 Benchmark]: TraceAbstraction took 50212.76ms. Allocated memory was 234.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 145.6MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 576.3MB. Max. memory is 16.1GB. [2022-11-21 16:57:36,780 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 1.8GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:57:36,781 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.27ms. Allocated memory is still 169.9MB. Free memory is still 142.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 696.58ms. Allocated memory is still 169.9MB. Free memory was 121.6MB in the beginning and 97.3MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.61ms. Allocated memory is still 169.9MB. Free memory was 97.3MB in the beginning and 94.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.80ms. Allocated memory is still 169.9MB. Free memory was 94.6MB in the beginning and 92.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1893.72ms. Allocated memory was 169.9MB in the beginning and 234.9MB in the end (delta: 65.0MB). Free memory was 92.1MB in the beginning and 146.7MB in the end (delta: -54.5MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * TraceAbstraction took 50212.76ms. Allocated memory was 234.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 145.6MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 576.3MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 1.8GB. Free memory is still 1.2GB. 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: 19.9s, 184 PlacesBefore, 81 PlacesAfterwards, 176 TransitionsBefore, 72 TransitionsAfterwards, 6462 CoEnabledTransitionPairs, 8 FixpointIterations, 68 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 152 TotalNumberOfCompositions, 31792 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10901, independent: 10315, independent conditional: 0, independent unconditional: 10315, dependent: 545, dependent conditional: 0, dependent unconditional: 545, unknown: 41, unknown conditional: 0, unknown unconditional: 41] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3589, independent: 3495, independent conditional: 0, independent unconditional: 3495, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3589, independent: 3284, independent conditional: 0, independent unconditional: 3284, dependent: 305, dependent conditional: 0, dependent unconditional: 305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 305, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1937, independent: 946, independent conditional: 0, independent unconditional: 946, dependent: 888, dependent conditional: 0, dependent unconditional: 888, unknown: 103, unknown conditional: 0, unknown unconditional: 103] ], Cache Queries: [ total: 10901, independent: 6820, independent conditional: 0, independent unconditional: 6820, dependent: 455, dependent conditional: 0, dependent unconditional: 455, unknown: 3626, unknown conditional: 0, unknown unconditional: 3626] , Statistics on independence cache: Total cache size (in pairs): 647, Positive cache size: 596, Positive conditional cache size: 0, Positive unconditional cache size: 596, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 4, Unknown conditional cache size: 0, Unknown unconditional cache size: 4 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L734] 0 _Bool x$flush_delayed; [L735] 0 int x$mem_tmp; [L736] 0 _Bool x$r_buff0_thd0; [L737] 0 _Bool x$r_buff0_thd1; [L738] 0 _Bool x$r_buff0_thd2; [L739] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff1_thd0; [L741] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd2; [L743] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$read_delayed; [L745] 0 int *x$read_delayed_var; [L746] 0 int x$w_buff0; [L747] 0 _Bool x$w_buff0_used; [L748] 0 int x$w_buff1; [L749] 0 _Bool x$w_buff1_used; [L751] 0 int y = 0; [L752] 0 _Bool weak$$choice0; [L753] 0 _Bool weak$$choice1; [L754] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1988; [L849] FCALL, FORK 0 pthread_create(&t1988, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1988, ((void *)0), P0, ((void *)0))=-1, t1988={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L850] 0 pthread_t t1989; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1988={7:0}, t1989={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] FCALL, FORK 0 pthread_create(&t1989, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1989, ((void *)0), P1, ((void *)0))=0, t1988={7:0}, t1989={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] 0 pthread_t t1990; [L787] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 2 x$flush_delayed = weak$$choice2 [L790] EXPR 2 \read(x) [L790] 2 x$mem_tmp = x [L791] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L792] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L792] EXPR 2 \read(x) [L792] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L792] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L793] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L794] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L795] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L796] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L797] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L798] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L800] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L801] EXPR 2 \read(x) [L801] 2 __unbuffered_p1_EAX = x [L802] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L802] EXPR 2 \read(x) [L802] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L802] 2 x = x$flush_delayed ? x$mem_tmp : x [L803] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L806] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L853] FCALL, FORK 0 pthread_create(&t1990, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1990, ((void *)0), P2, ((void *)0))=1, t1988={7:0}, t1989={5:0}, t1990={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 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) [L827] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L761] 1 x$w_buff1 = x$w_buff0 [L762] 1 x$w_buff0 = 1 [L763] 1 x$w_buff1_used = x$w_buff0_used [L764] 1 x$w_buff0_used = (_Bool)1 [L765] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L765] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L773] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L775] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L776] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L777] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L809] EXPR 2 \read(x) [L809] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] 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) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 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=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 \read(x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 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) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 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 [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1988={7:0}, t1989={5:0}, t1990={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L866] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L867] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L867] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L867] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L867] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L868] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 851]: 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, 230 locations, 75 error locations. Started 1 CEGAR loops. OverallTime: 49.9s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 21.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1507 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1507 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 324 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3967 IncrementalHoareTripleChecker+Invalid, 4291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 324 mSolverCounterUnsat, 35 mSDtfsCounter, 3967 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31296occurred in iteration=0, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 14702 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 297 ConstructedInterpolants, 0 QuantifiedInterpolants, 3794 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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-21 16:57:36,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe009_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a --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 be536b3b382c4e63adbabc11deb06983f35dbd290b78e0d42f1a068990873986 --- 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-b5237d8 [2022-11-21 16:57:39,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:57:39,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:57:39,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:57:39,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:57:39,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:57:39,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:57:39,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:57:39,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:57:39,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:57:39,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:57:39,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:57:39,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:57:39,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:57:39,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:57:39,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:57:39,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:57:39,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:57:39,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:57:39,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:57:39,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:57:39,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:57:39,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:57:39,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:57:39,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:57:39,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:57:39,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:57:39,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:57:39,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:57:39,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:57:39,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:57:39,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:57:39,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:57:39,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:57:39,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:57:39,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:57:39,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:57:39,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:57:39,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:57:39,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:57:39,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:57:39,331 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-21 16:57:39,376 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:57:39,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:57:39,380 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:57:39,380 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:57:39,381 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:57:39,382 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:57:39,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:57:39,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:57:39,383 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:57:39,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:57:39,384 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:57:39,385 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:57:39,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:57:39,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:57:39,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:57:39,385 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:57:39,386 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:57:39,386 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:57:39,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:57:39,386 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:57:39,387 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 16:57:39,387 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 16:57:39,387 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:57:39,387 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:57:39,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:57:39,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:57:39,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:57:39,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:57:39,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:57:39,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:57:39,389 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 16:57:39,389 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 16:57:39,390 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 16:57:39,390 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_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/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_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a 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 -> be536b3b382c4e63adbabc11deb06983f35dbd290b78e0d42f1a068990873986 [2022-11-21 16:57:39,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:57:39,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:57:39,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:57:39,789 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:57:39,790 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:57:39,791 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe009_power.opt.i [2022-11-21 16:57:42,885 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:57:43,174 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:57:43,174 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/sv-benchmarks/c/pthread-wmm/safe009_power.opt.i [2022-11-21 16:57:43,197 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/data/a6f3787e7/5c6e9476b352410eb5c633b276ed36cc/FLAG5ea80f07a [2022-11-21 16:57:43,217 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/data/a6f3787e7/5c6e9476b352410eb5c633b276ed36cc [2022-11-21 16:57:43,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:57:43,231 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:57:43,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:57:43,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:57:43,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:57:43,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:57:43" (1/1) ... [2022-11-21 16:57:43,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f84c4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:43, skipping insertion in model container [2022-11-21 16:57:43,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:57:43" (1/1) ... [2022-11-21 16:57:43,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:57:43,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:57:43,472 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_598a4185-fe29-4b10-918f-c9bca8e9e4eb/sv-benchmarks/c/pthread-wmm/safe009_power.opt.i[951,964] [2022-11-21 16:57:43,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:57:43,706 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:57:43,719 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_598a4185-fe29-4b10-918f-c9bca8e9e4eb/sv-benchmarks/c/pthread-wmm/safe009_power.opt.i[951,964] [2022-11-21 16:57:43,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:57:43,824 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:57:43,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:43 WrapperNode [2022-11-21 16:57:43,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:57:43,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:57:43,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:57:43,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:57:43,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:43" (1/1) ... [2022-11-21 16:57:43,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:43" (1/1) ... [2022-11-21 16:57:43,882 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2022-11-21 16:57:43,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:57:43,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:57:43,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:57:43,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:57:43,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:43" (1/1) ... [2022-11-21 16:57:43,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:43" (1/1) ... [2022-11-21 16:57:43,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:43" (1/1) ... [2022-11-21 16:57:43,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:43" (1/1) ... [2022-11-21 16:57:43,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:43" (1/1) ... [2022-11-21 16:57:43,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:43" (1/1) ... [2022-11-21 16:57:43,939 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:43" (1/1) ... [2022-11-21 16:57:43,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:43" (1/1) ... [2022-11-21 16:57:43,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:57:43,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:57:43,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:57:43,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:57:43,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:43" (1/1) ... [2022-11-21 16:57:43,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:57:44,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:57:44,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:57:44,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:57:44,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-21 16:57:44,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:57:44,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:57:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:57:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:57:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-21 16:57:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-21 16:57:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-21 16:57:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 16:57:44,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 16:57:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 16:57:44,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 16:57:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 16:57:44,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 16:57:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:57:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:57:44,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:57:44,076 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:57:44,319 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:57:44,321 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:57:45,072 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:57:45,915 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:57:45,915 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:57:45,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:57:45 BoogieIcfgContainer [2022-11-21 16:57:45,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:57:45,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:57:45,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:57:45,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:57:45,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:57:43" (1/3) ... [2022-11-21 16:57:45,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440c6b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:57:45, skipping insertion in model container [2022-11-21 16:57:45,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:43" (2/3) ... [2022-11-21 16:57:45,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440c6b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:57:45, skipping insertion in model container [2022-11-21 16:57:45,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:57:45" (3/3) ... [2022-11-21 16:57:45,930 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_power.opt.i [2022-11-21 16:57:45,950 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:57:45,950 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2022-11-21 16:57:45,951 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:57:46,151 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:57:46,198 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 16:57:46,218 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 177 transitions, 369 flow [2022-11-21 16:57:46,221 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 177 transitions, 369 flow [2022-11-21 16:57:46,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 177 transitions, 369 flow [2022-11-21 16:57:46,365 INFO L130 PetriNetUnfolder]: 2/174 cut-off events. [2022-11-21 16:57:46,365 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:57:46,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 174 events. 2/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 238 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-11-21 16:57:46,378 INFO L119 LiptonReduction]: Number of co-enabled transitions 6462 [2022-11-21 16:58:03,558 WARN L233 SmtUtils]: Spent 7.68s on a formula simplification. DAG size of input: 195 DAG size of output: 191 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-21 16:58:12,839 WARN L233 SmtUtils]: Spent 7.25s on a formula simplification. DAG size of input: 224 DAG size of output: 220 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-21 16:58:32,032 INFO L134 LiptonReduction]: Checked pairs total: 31631 [2022-11-21 16:58:32,032 INFO L136 LiptonReduction]: Total number of compositions: 153 [2022-11-21 16:58:32,040 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 72 transitions, 159 flow [2022-11-21 16:58:33,292 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 31296 states, 25361 states have (on average 4.56180749970427) internal successors, (115692), 31295 states have internal predecessors, (115692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:33,332 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:58:33,340 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;@c6cdc8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:58:33,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2022-11-21 16:58:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 31296 states, 25361 states have (on average 4.56180749970427) internal successors, (115692), 31295 states have internal predecessors, (115692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 16:58:33,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:33,388 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 16:58:33,389 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:58:33,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:33,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1156, now seen corresponding path program 1 times [2022-11-21 16:58:33,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:33,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344538238] [2022-11-21 16:58:33,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:33,413 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-21 16:58:33,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:33,421 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:33,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:33,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 16:58:33,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:58:33,655 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-21 16:58:33,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:58:33,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:58:33,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344538238] [2022-11-21 16:58:33,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344538238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:33,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:33,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 16:58:33,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452204112] [2022-11-21 16:58:33,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:33,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:58:33,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:58:33,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:58:33,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:58:33,734 INFO L87 Difference]: Start difference. First operand has 31296 states, 25361 states have (on average 4.56180749970427) internal successors, (115692), 31295 states have internal predecessors, (115692), 0 states have call successors, (0), 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-21 16:58:34,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:34,648 INFO L93 Difference]: Finished difference Result 13554 states and 48704 transitions. [2022-11-21 16:58:34,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:58:34,663 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-21 16:58:34,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:34,885 INFO L225 Difference]: With dead ends: 13554 [2022-11-21 16:58:34,885 INFO L226 Difference]: Without dead ends: 13554 [2022-11-21 16:58:34,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-21 16:58:34,889 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:34,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:58:35,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13554 states. [2022-11-21 16:58:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13554 to 13554. [2022-11-21 16:58:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 11665 states have (on average 4.175225032147449) internal successors, (48704), 13553 states have internal predecessors, (48704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 48704 transitions. [2022-11-21 16:58:36,170 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 48704 transitions. Word has length 1 [2022-11-21 16:58:36,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:36,170 INFO L495 AbstractCegarLoop]: Abstraction has 13554 states and 48704 transitions. [2022-11-21 16:58:36,171 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-21 16:58:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 48704 transitions. [2022-11-21 16:58:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 16:58:36,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:36,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 16:58:36,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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)] Ended with exit code 0 [2022-11-21 16:58:36,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:36,386 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:58:36,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:36,387 INFO L85 PathProgramCache]: Analyzing trace with hash 35439659, now seen corresponding path program 1 times [2022-11-21 16:58:36,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:36,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268834461] [2022-11-21 16:58:36,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:36,388 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-21 16:58:36,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:36,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:36,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:36,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:58:36,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:58:36,709 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-21 16:58:36,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:58:36,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:58:36,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268834461] [2022-11-21 16:58:36,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268834461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:36,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:36,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:58:36,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376200192] [2022-11-21 16:58:36,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:36,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:58:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:58:36,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:58:36,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:58:36,718 INFO L87 Difference]: Start difference. First operand 13554 states and 48704 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:37,431 INFO L93 Difference]: Finished difference Result 12198 states and 43695 transitions. [2022-11-21 16:58:37,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:58:37,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-21 16:58:37,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:37,556 INFO L225 Difference]: With dead ends: 12198 [2022-11-21 16:58:37,556 INFO L226 Difference]: Without dead ends: 12198 [2022-11-21 16:58:37,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:58:37,558 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:37,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:58:37,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12198 states. [2022-11-21 16:58:38,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12198 to 12198. [2022-11-21 16:58:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12198 states, 10624 states have (on average 4.112857680722891) internal successors, (43695), 12197 states have internal predecessors, (43695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:38,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12198 states to 12198 states and 43695 transitions. [2022-11-21 16:58:38,450 INFO L78 Accepts]: Start accepts. Automaton has 12198 states and 43695 transitions. Word has length 4 [2022-11-21 16:58:38,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:38,451 INFO L495 AbstractCegarLoop]: Abstraction has 12198 states and 43695 transitions. [2022-11-21 16:58:38,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 12198 states and 43695 transitions. [2022-11-21 16:58:38,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 16:58:38,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:38,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 16:58:38,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:38,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:38,664 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:58:38,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:38,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1098630388, now seen corresponding path program 1 times [2022-11-21 16:58:38,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:38,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161939711] [2022-11-21 16:58:38,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:38,666 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-21 16:58:38,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:38,668 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:38,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:38,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:58:38,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:58:38,957 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:58:38,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-21 16:58:39,102 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-21 16:58:39,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:58:39,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:58:39,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161939711] [2022-11-21 16:58:39,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161939711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:39,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:39,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:58:39,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649727296] [2022-11-21 16:58:39,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:39,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:58:39,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:58:39,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:58:39,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:58:39,124 INFO L87 Difference]: Start difference. First operand 12198 states and 43695 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:39,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:39,571 INFO L93 Difference]: Finished difference Result 6375 states and 22094 transitions. [2022-11-21 16:58:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:58:39,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-21 16:58:39,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:39,603 INFO L225 Difference]: With dead ends: 6375 [2022-11-21 16:58:39,604 INFO L226 Difference]: Without dead ends: 6375 [2022-11-21 16:58:39,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:58:39,605 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:39,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:58:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6375 states. [2022-11-21 16:58:39,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6375 to 6375. [2022-11-21 16:58:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6375 states, 5846 states have (on average 3.7793362983236403) internal successors, (22094), 6374 states have internal predecessors, (22094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6375 states to 6375 states and 22094 transitions. [2022-11-21 16:58:39,820 INFO L78 Accepts]: Start accepts. Automaton has 6375 states and 22094 transitions. Word has length 5 [2022-11-21 16:58:39,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:39,821 INFO L495 AbstractCegarLoop]: Abstraction has 6375 states and 22094 transitions. [2022-11-21 16:58:39,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 6375 states and 22094 transitions. [2022-11-21 16:58:39,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 16:58:39,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:39,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 16:58:39,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:40,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:40,034 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:58:40,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:40,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1098630389, now seen corresponding path program 1 times [2022-11-21 16:58:40,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:40,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392474422] [2022-11-21 16:58:40,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:40,035 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-21 16:58:40,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:40,036 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:40,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:40,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:58:40,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:58:40,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:58:40,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 16:58:40,329 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-21 16:58:40,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:58:40,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:58:40,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392474422] [2022-11-21 16:58:40,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392474422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:40,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:40,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:58:40,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231554816] [2022-11-21 16:58:40,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:40,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:58:40,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:58:40,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:58:40,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:58:40,332 INFO L87 Difference]: Start difference. First operand 6375 states and 22094 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:40,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:40,590 INFO L93 Difference]: Finished difference Result 2128 states and 6993 transitions. [2022-11-21 16:58:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:58:40,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-21 16:58:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:40,603 INFO L225 Difference]: With dead ends: 2128 [2022-11-21 16:58:40,603 INFO L226 Difference]: Without dead ends: 2128 [2022-11-21 16:58:40,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:58:40,607 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:40,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:58:40,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2022-11-21 16:58:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2128. [2022-11-21 16:58:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 2054 states have (on average 3.4045764362220057) internal successors, (6993), 2127 states have internal predecessors, (6993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 6993 transitions. [2022-11-21 16:58:40,691 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 6993 transitions. Word has length 5 [2022-11-21 16:58:40,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:40,691 INFO L495 AbstractCegarLoop]: Abstraction has 2128 states and 6993 transitions. [2022-11-21 16:58:40,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 6993 transitions. [2022-11-21 16:58:40,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 16:58:40,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:40,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:40,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:40,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:40,906 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:58:40,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:40,907 INFO L85 PathProgramCache]: Analyzing trace with hash -444679639, now seen corresponding path program 1 times [2022-11-21 16:58:40,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:40,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660661834] [2022-11-21 16:58:40,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:40,908 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-21 16:58:40,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:40,909 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:40,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:41,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:58:41,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:58:41,183 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-21 16:58:41,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:58:41,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:58:41,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660661834] [2022-11-21 16:58:41,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660661834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:41,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:41,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:58:41,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305094608] [2022-11-21 16:58:41,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:41,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:58:41,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:58:41,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:58:41,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:58:41,186 INFO L87 Difference]: Start difference. First operand 2128 states and 6993 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-21 16:58:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:41,412 INFO L93 Difference]: Finished difference Result 1001 states and 2650 transitions. [2022-11-21 16:58:41,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:58:41,413 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-21 16:58:41,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:41,418 INFO L225 Difference]: With dead ends: 1001 [2022-11-21 16:58:41,418 INFO L226 Difference]: Without dead ends: 1001 [2022-11-21 16:58:41,418 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-21 16:58:41,419 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:41,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:58:41,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2022-11-21 16:58:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2022-11-21 16:58:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 951 states have (on average 2.786540483701367) internal successors, (2650), 1000 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 2650 transitions. [2022-11-21 16:58:41,451 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 2650 transitions. Word has length 10 [2022-11-21 16:58:41,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:41,452 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 2650 transitions. [2022-11-21 16:58:41,452 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-21 16:58:41,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 2650 transitions. [2022-11-21 16:58:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 16:58:41,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:41,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:41,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:41,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:41,682 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:58:41,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:41,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1858502608, now seen corresponding path program 1 times [2022-11-21 16:58:41,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:41,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071407343] [2022-11-21 16:58:41,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:41,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:58:41,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:41,685 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:41,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:41,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:58:41,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:58:41,981 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-21 16:58:41,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:58:41,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:58:41,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071407343] [2022-11-21 16:58:41,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071407343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:41,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:41,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:58:41,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227386466] [2022-11-21 16:58:41,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:41,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:58:41,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:58:41,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:58:41,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:58:41,987 INFO L87 Difference]: Start difference. First operand 1001 states and 2650 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-21 16:58:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:42,257 INFO L93 Difference]: Finished difference Result 336 states and 728 transitions. [2022-11-21 16:58:42,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:58:42,257 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-21 16:58:42,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:42,259 INFO L225 Difference]: With dead ends: 336 [2022-11-21 16:58:42,259 INFO L226 Difference]: Without dead ends: 336 [2022-11-21 16:58:42,259 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-21 16:58:42,260 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:42,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:58:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-11-21 16:58:42,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2022-11-21 16:58:42,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 318 states have (on average 2.289308176100629) internal successors, (728), 335 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 728 transitions. [2022-11-21 16:58:42,270 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 728 transitions. Word has length 13 [2022-11-21 16:58:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:42,271 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 728 transitions. [2022-11-21 16:58:42,271 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-21 16:58:42,271 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 728 transitions. [2022-11-21 16:58:42,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:58:42,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:42,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:42,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:42,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:42,486 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:58:42,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:42,486 INFO L85 PathProgramCache]: Analyzing trace with hash 5224509, now seen corresponding path program 1 times [2022-11-21 16:58:42,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:42,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563602892] [2022-11-21 16:58:42,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:42,487 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-21 16:58:42,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:42,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:42,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:42,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:58:42,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:58:42,825 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-21 16:58:42,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:58:42,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:58:42,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563602892] [2022-11-21 16:58:42,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563602892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:42,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:42,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:58:42,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850294642] [2022-11-21 16:58:42,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:42,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:58:42,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:58:42,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:58:42,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:58:42,829 INFO L87 Difference]: Start difference. First operand 336 states and 728 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-21 16:58:43,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:43,223 INFO L93 Difference]: Finished difference Result 201 states and 468 transitions. [2022-11-21 16:58:43,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:58:43,224 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-21 16:58:43,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:43,225 INFO L225 Difference]: With dead ends: 201 [2022-11-21 16:58:43,225 INFO L226 Difference]: Without dead ends: 201 [2022-11-21 16:58:43,225 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-21 16:58:43,226 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 28 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:43,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 9 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:58:43,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-21 16:58:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-11-21 16:58:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 2.3756345177664975) internal successors, (468), 200 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:43,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 468 transitions. [2022-11-21 16:58:43,230 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 468 transitions. Word has length 17 [2022-11-21 16:58:43,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:43,230 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 468 transitions. [2022-11-21 16:58:43,230 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-21 16:58:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 468 transitions. [2022-11-21 16:58:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:58:43,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:43,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:43,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:43,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:43,433 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:58:43,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:43,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1866095000, now seen corresponding path program 1 times [2022-11-21 16:58:43,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:43,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108018540] [2022-11-21 16:58:43,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:43,435 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-21 16:58:43,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:43,436 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:43,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:58:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:43,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 16:58:43,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:58:43,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 16:58:43,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 16:59:17,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 16:59:17,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 16:59:17,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 16:59:17,464 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-21 16:59:17,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:59:17,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:59:17,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108018540] [2022-11-21 16:59:17,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108018540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:17,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:17,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:59:17,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991747401] [2022-11-21 16:59:17,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:17,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:59:17,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:59:17,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:59:17,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:59:17,466 INFO L87 Difference]: Start difference. First operand 201 states and 468 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:18,253 INFO L93 Difference]: Finished difference Result 292 states and 666 transitions. [2022-11-21 16:59:18,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:59:18,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 16:59:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:18,254 INFO L225 Difference]: With dead ends: 292 [2022-11-21 16:59:18,254 INFO L226 Difference]: Without dead ends: 292 [2022-11-21 16:59:18,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:59:18,255 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 91 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:18,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 8 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 16:59:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-21 16:59:18,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 200. [2022-11-21 16:59:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 197 states have (on average 2.3705583756345177) internal successors, (467), 199 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 467 transitions. [2022-11-21 16:59:18,262 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 467 transitions. Word has length 21 [2022-11-21 16:59:18,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:18,262 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 467 transitions. [2022-11-21 16:59:18,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 467 transitions. [2022-11-21 16:59:18,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:59:18,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:18,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:18,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:59:18,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:59:18,482 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 16:59:18,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1866095001, now seen corresponding path program 1 times [2022-11-21 16:59:18,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:59:18,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968183206] [2022-11-21 16:59:18,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:18,483 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-21 16:59:18,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:59:18,484 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:59:18,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 16:59:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:18,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 16:59:18,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:59:18,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 16:59:18,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 17:03:22,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 17:03:22,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 17:03:22,988 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:03:22,991 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:03:23,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 17:03:23,184 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-21 17:03:23,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:03:23,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:03:23,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968183206] [2022-11-21 17:03:23,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968183206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:03:23,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:03:23,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:03:23,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712766516] [2022-11-21 17:03:23,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:03:23,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:03:23,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:03:23,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:03:23,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:03:23,187 INFO L87 Difference]: Start difference. First operand 200 states and 467 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:03:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:03:23,931 INFO L93 Difference]: Finished difference Result 290 states and 664 transitions. [2022-11-21 17:03:23,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 17:03:23,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 17:03:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:03:23,933 INFO L225 Difference]: With dead ends: 290 [2022-11-21 17:03:23,933 INFO L226 Difference]: Without dead ends: 290 [2022-11-21 17:03:23,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-21 17:03:23,934 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 93 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:03:23,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 8 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:03:23,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-21 17:03:23,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 199. [2022-11-21 17:03:23,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.3654822335025383) internal successors, (466), 198 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:03:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 466 transitions. [2022-11-21 17:03:23,940 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 466 transitions. Word has length 21 [2022-11-21 17:03:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:03:23,940 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 466 transitions. [2022-11-21 17:03:23,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:03:23,941 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 466 transitions. [2022-11-21 17:03:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 17:03:23,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:03:23,942 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-21 17:03:23,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 17:03:24,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 17:03:24,155 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 17:03:24,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:03:24,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2014365734, now seen corresponding path program 1 times [2022-11-21 17:03:24,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:03:24,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709080618] [2022-11-21 17:03:24,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:03:24,156 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-21 17:03:24,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:03:24,157 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 17:03:24,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 17:03:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:03:24,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 17:03:24,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:03:24,469 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-21 17:03:24,469 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:03:24,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:03:24,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709080618] [2022-11-21 17:03:24,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709080618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:03:24,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:03:24,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:03:24,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407426137] [2022-11-21 17:03:24,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:03:24,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:03:24,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:03:24,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:03:24,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:03:24,472 INFO L87 Difference]: Start difference. First operand 199 states and 466 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-21 17:03:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:03:24,677 INFO L93 Difference]: Finished difference Result 313 states and 721 transitions. [2022-11-21 17:03:24,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:03:24,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-21 17:03:24,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:03:24,678 INFO L225 Difference]: With dead ends: 313 [2022-11-21 17:03:24,679 INFO L226 Difference]: Without dead ends: 313 [2022-11-21 17:03:24,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:03:24,679 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:03:24,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:03:24,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-11-21 17:03:24,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2022-11-21 17:03:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 307 states have (on average 2.3387622149837135) internal successors, (718), 308 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:03:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 718 transitions. [2022-11-21 17:03:24,687 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 718 transitions. Word has length 22 [2022-11-21 17:03:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:03:24,688 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 718 transitions. [2022-11-21 17:03:24,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-21 17:03:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 718 transitions. [2022-11-21 17:03:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 17:03:24,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:03:24,689 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-21 17:03:24,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-11-21 17:03:24,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 17:03:24,902 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 17:03:24,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:03:24,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1207924576, now seen corresponding path program 2 times [2022-11-21 17:03:24,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:03:24,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852809537] [2022-11-21 17:03:24,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:03:24,903 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-21 17:03:24,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:03:24,905 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 17:03:24,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 17:03:25,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 17:03:25,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:03:25,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 17:03:25,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:03:25,213 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-21 17:03:25,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:03:25,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:03:25,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852809537] [2022-11-21 17:03:25,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852809537] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:03:25,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:03:25,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:03:25,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091206612] [2022-11-21 17:03:25,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:03:25,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:03:25,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:03:25,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:03:25,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:03:25,216 INFO L87 Difference]: Start difference. First operand 309 states and 718 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:03:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:03:25,519 INFO L93 Difference]: Finished difference Result 482 states and 1060 transitions. [2022-11-21 17:03:25,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:03:25,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 17:03:25,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:03:25,521 INFO L225 Difference]: With dead ends: 482 [2022-11-21 17:03:25,521 INFO L226 Difference]: Without dead ends: 482 [2022-11-21 17:03:25,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:03:25,522 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:03:25,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:03:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-21 17:03:25,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 246. [2022-11-21 17:03:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 244 states have (on average 2.3155737704918034) internal successors, (565), 245 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:03:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 565 transitions. [2022-11-21 17:03:25,531 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 565 transitions. Word has length 22 [2022-11-21 17:03:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:03:25,532 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 565 transitions. [2022-11-21 17:03:25,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:03:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 565 transitions. [2022-11-21 17:03:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 17:03:25,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:03:25,535 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-21 17:03:25,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-21 17:03:25,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 17:03:25,746 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-21 17:03:25,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:03:25,746 INFO L85 PathProgramCache]: Analyzing trace with hash 176854944, now seen corresponding path program 3 times [2022-11-21 17:03:25,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:03:25,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572688641] [2022-11-21 17:03:25,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 17:03:25,747 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-21 17:03:25,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:03:25,748 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 17:03:25,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 17:03:26,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-21 17:03:26,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 17:03:26,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:03:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:03:26,290 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-21 17:03:26,290 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 17:03:26,291 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2022-11-21 17:03:26,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2022-11-21 17:03:26,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2022-11-21 17:03:26,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2022-11-21 17:03:26,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2022-11-21 17:03:26,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2022-11-21 17:03:26,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2022-11-21 17:03:26,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2022-11-21 17:03:26,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2022-11-21 17:03:26,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2022-11-21 17:03:26,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2022-11-21 17:03:26,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2022-11-21 17:03:26,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2022-11-21 17:03:26,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2022-11-21 17:03:26,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2022-11-21 17:03:26,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2022-11-21 17:03:26,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2022-11-21 17:03:26,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2022-11-21 17:03:26,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2022-11-21 17:03:26,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2022-11-21 17:03:26,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2022-11-21 17:03:26,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2022-11-21 17:03:26,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2022-11-21 17:03:26,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2022-11-21 17:03:26,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2022-11-21 17:03:26,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2022-11-21 17:03:26,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2022-11-21 17:03:26,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2022-11-21 17:03:26,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2022-11-21 17:03:26,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2022-11-21 17:03:26,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2022-11-21 17:03:26,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2022-11-21 17:03:26,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2022-11-21 17:03:26,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2022-11-21 17:03:26,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2022-11-21 17:03:26,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2022-11-21 17:03:26,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2022-11-21 17:03:26,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2022-11-21 17:03:26,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2022-11-21 17:03:26,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2022-11-21 17:03:26,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2022-11-21 17:03:26,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2022-11-21 17:03:26,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2022-11-21 17:03:26,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2022-11-21 17:03:26,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2022-11-21 17:03:26,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2022-11-21 17:03:26,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2022-11-21 17:03:26,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2022-11-21 17:03:26,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2022-11-21 17:03:26,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2022-11-21 17:03:26,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2022-11-21 17:03:26,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2022-11-21 17:03:26,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2022-11-21 17:03:26,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2022-11-21 17:03:26,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2022-11-21 17:03:26,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2022-11-21 17:03:26,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2022-11-21 17:03:26,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2022-11-21 17:03:26,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2022-11-21 17:03:26,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2022-11-21 17:03:26,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2022-11-21 17:03:26,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2022-11-21 17:03:26,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2022-11-21 17:03:26,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2022-11-21 17:03:26,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2022-11-21 17:03:26,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2022-11-21 17:03:26,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2022-11-21 17:03:26,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2022-11-21 17:03:26,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2022-11-21 17:03:26,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2022-11-21 17:03:26,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2022-11-21 17:03:26,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2022-11-21 17:03:26,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2022-11-21 17:03:26,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2022-11-21 17:03:26,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2022-11-21 17:03:26,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 17:03:26,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/mathsat -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-21 17:03:26,523 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:03:26,529 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 17:03:26,529 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 17:03:26,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 05:03:26 BasicIcfg [2022-11-21 17:03:26,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 17:03:26,660 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 17:03:26,660 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 17:03:26,664 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 17:03:26,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:57:45" (3/4) ... [2022-11-21 17:03:26,667 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 17:03:26,669 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 17:03:26,670 INFO L158 Benchmark]: Toolchain (without parser) took 343439.55ms. Allocated memory was 65.0MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 35.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 561.5MB. Max. memory is 16.1GB. [2022-11-21 17:03:26,670 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 65.0MB. Free memory is still 43.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:03:26,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 590.42ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 35.1MB in the beginning and 52.6MB in the end (delta: -17.5MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-11-21 17:03:26,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.80ms. Allocated memory is still 90.2MB. Free memory was 52.6MB in the beginning and 49.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:03:26,671 INFO L158 Benchmark]: Boogie Preprocessor took 67.50ms. Allocated memory is still 90.2MB. Free memory was 49.9MB in the beginning and 47.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:03:26,672 INFO L158 Benchmark]: RCFGBuilder took 1966.37ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 47.2MB in the beginning and 62.3MB in the end (delta: -15.1MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2022-11-21 17:03:26,674 INFO L158 Benchmark]: TraceAbstraction took 340738.88ms. Allocated memory was 111.1MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 61.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 541.7MB. Max. memory is 16.1GB. [2022-11-21 17:03:26,674 INFO L158 Benchmark]: Witness Printer took 9.63ms. Allocated memory is still 1.7GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:03:26,679 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.32ms. Allocated memory is still 65.0MB. Free memory is still 43.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 590.42ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 35.1MB in the beginning and 52.6MB in the end (delta: -17.5MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.80ms. Allocated memory is still 90.2MB. Free memory was 52.6MB in the beginning and 49.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.50ms. Allocated memory is still 90.2MB. Free memory was 49.9MB in the beginning and 47.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1966.37ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 47.2MB in the beginning and 62.3MB in the end (delta: -15.1MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * TraceAbstraction took 340738.88ms. Allocated memory was 111.1MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 61.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 541.7MB. Max. memory is 16.1GB. * Witness Printer took 9.63ms. Allocated memory is still 1.7GB. Free memory is still 1.1GB. 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: 45.8s, 185 PlacesBefore, 81 PlacesAfterwards, 177 TransitionsBefore, 72 TransitionsAfterwards, 6462 CoEnabledTransitionPairs, 8 FixpointIterations, 69 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 153 TotalNumberOfCompositions, 31631 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11638, independent: 11057, independent conditional: 0, independent unconditional: 11057, dependent: 515, dependent conditional: 0, dependent unconditional: 515, unknown: 66, unknown conditional: 0, unknown unconditional: 66] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3715, independent: 3613, independent conditional: 0, independent unconditional: 3613, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3715, independent: 3346, independent conditional: 0, independent unconditional: 3346, dependent: 369, dependent conditional: 0, dependent unconditional: 369, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 369, independent: 267, independent conditional: 0, independent unconditional: 267, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4960, independent: 2149, independent conditional: 0, independent unconditional: 2149, dependent: 2241, dependent conditional: 0, dependent unconditional: 2241, unknown: 570, unknown conditional: 0, unknown unconditional: 570] ], Cache Queries: [ total: 11638, independent: 7444, independent conditional: 0, independent unconditional: 7444, dependent: 420, dependent conditional: 0, dependent unconditional: 420, unknown: 3774, unknown conditional: 0, unknown unconditional: 3774] , Statistics on independence cache: Total cache size (in pairs): 745, Positive cache size: 699, Positive conditional cache size: 0, Positive unconditional cache size: 699, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L734] 0 _Bool x$flush_delayed; [L735] 0 int x$mem_tmp; [L736] 0 _Bool x$r_buff0_thd0; [L737] 0 _Bool x$r_buff0_thd1; [L738] 0 _Bool x$r_buff0_thd2; [L739] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff1_thd0; [L741] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd2; [L743] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$read_delayed; [L745] 0 int *x$read_delayed_var; [L746] 0 int x$w_buff0; [L747] 0 _Bool x$w_buff0_used; [L748] 0 int x$w_buff1; [L749] 0 _Bool x$w_buff1_used; [L751] 0 int y = 0; [L752] 0 _Bool weak$$choice0; [L753] 0 _Bool weak$$choice1; [L754] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1988; [L849] FCALL, FORK 0 pthread_create(&t1988, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1988, ((void *)0), P0, ((void *)0))=-1, t1988={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L850] 0 pthread_t t1989; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1988={7:0}, t1989={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] FCALL, FORK 0 pthread_create(&t1989, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1989, ((void *)0), P1, ((void *)0))=0, t1988={7:0}, t1989={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L787] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 2 x$flush_delayed = weak$$choice2 [L790] EXPR 2 \read(x) [L790] 2 x$mem_tmp = x [L791] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L792] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L792] EXPR 2 \read(x) [L792] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L792] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L793] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L794] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L795] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L796] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L797] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L798] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L800] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L801] EXPR 2 \read(x) [L801] 2 __unbuffered_p1_EAX = x [L802] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L802] EXPR 2 \read(x) [L802] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L802] 2 x = x$flush_delayed ? x$mem_tmp : x [L803] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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] [L806] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1] [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L809] EXPR 2 \read(x) [L809] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] 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) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L852] 0 pthread_t t1990; [L853] FCALL, FORK 0 pthread_create(&t1990, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1990, ((void *)0), P2, ((void *)0))=1, t1988={7:0}, t1989={14:0}, t1990={15:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1] [L823] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=2] [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 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) [L827] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 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=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L758] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=2] [L761] 1 x$w_buff1 = x$w_buff0 [L762] 1 x$w_buff0 = 1 [L763] 1 x$w_buff1_used = x$w_buff0_used [L764] 1 x$w_buff0_used = (_Bool)1 [L765] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L765] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L773] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L775] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L776] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L777] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 \read(x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 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) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 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 [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1988={7:0}, t1989={14:0}, t1990={15:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L866] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L867] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L867] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L867] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L867] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L868] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=2, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 851]: 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, 231 locations, 75 error locations. Started 1 CEGAR loops. OverallTime: 340.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 47.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 366 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 366 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1298 IncrementalHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 16 mSDtfsCounter, 1298 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31296occurred in iteration=0, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 423 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 279.0s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 848 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1479 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-21 17:03:26,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_598a4185-fe29-4b10-918f-c9bca8e9e4eb/bin/uautomizer-vX5HgA9Q3a/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