./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe015_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_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe015_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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_ab93050f-362b-4892-a1ad-749415b96d87/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 7ed03bf56a68b0ba240fc33c794b8871860875fa75320178f23c03b98fa54cab --- 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:27:16,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:27:16,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:27:16,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:27:16,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:27:16,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:27:16,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:27:16,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:27:16,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:27:16,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:27:16,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:27:16,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:27:16,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:27:16,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:27:16,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:27:16,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:27:16,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:27:16,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:27:16,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:27:16,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:27:16,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:27:16,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:27:16,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:27:16,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:27:16,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:27:16,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:27:16,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:27:16,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:27:16,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:27:16,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:27:16,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:27:16,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:27:16,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:27:16,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:27:16,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:27:16,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:27:16,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:27:16,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:27:16,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:27:16,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:27:16,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:27:16,243 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 16:27:16,292 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:27:16,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:27:16,293 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:27:16,293 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:27:16,294 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:27:16,294 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:27:16,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:27:16,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:27:16,295 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:27:16,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:27:16,297 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:27:16,297 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:27:16,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:27:16,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:27:16,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:27:16,298 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:27:16,298 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:27:16,298 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:27:16,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:27:16,299 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:27:16,299 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:27:16,299 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:27:16,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:27:16,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:27:16,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:27:16,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:27:16,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:27:16,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:27:16,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:27:16,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:27:16,302 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_ab93050f-362b-4892-a1ad-749415b96d87/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_ab93050f-362b-4892-a1ad-749415b96d87/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 -> 7ed03bf56a68b0ba240fc33c794b8871860875fa75320178f23c03b98fa54cab [2022-11-21 16:27:16,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:27:16,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:27:16,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:27:16,652 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:27:16,653 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:27:16,654 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe015_power.opt.i [2022-11-21 16:27:19,727 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:27:19,988 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:27:19,989 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/sv-benchmarks/c/pthread-wmm/safe015_power.opt.i [2022-11-21 16:27:20,004 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/data/d10892463/498ae491e28648688e6215fdf3b83590/FLAGcc45f4001 [2022-11-21 16:27:20,022 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/data/d10892463/498ae491e28648688e6215fdf3b83590 [2022-11-21 16:27:20,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:27:20,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:27:20,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:27:20,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:27:20,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:27:20,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:27:20" (1/1) ... [2022-11-21 16:27:20,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c03d52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:27:20, skipping insertion in model container [2022-11-21 16:27:20,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:27:20" (1/1) ... [2022-11-21 16:27:20,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:27:20,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:27:20,366 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_ab93050f-362b-4892-a1ad-749415b96d87/sv-benchmarks/c/pthread-wmm/safe015_power.opt.i[994,1007] [2022-11-21 16:27:20,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:27:20,723 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:27:20,741 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_ab93050f-362b-4892-a1ad-749415b96d87/sv-benchmarks/c/pthread-wmm/safe015_power.opt.i[994,1007] [2022-11-21 16:27:20,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:27:20,908 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:27:20,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:27:20 WrapperNode [2022-11-21 16:27:20,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:27:20,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:27:20,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:27:20,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:27:20,923 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:27:20" (1/1) ... [2022-11-21 16:27:20,966 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:27:20" (1/1) ... [2022-11-21 16:27:21,008 INFO L138 Inliner]: procedures = 176, calls = 86, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 166 [2022-11-21 16:27:21,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:27:21,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:27:21,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:27:21,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:27:21,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:27:20" (1/1) ... [2022-11-21 16:27:21,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:27:20" (1/1) ... [2022-11-21 16:27:21,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:27:20" (1/1) ... [2022-11-21 16:27:21,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:27:20" (1/1) ... [2022-11-21 16:27:21,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:27:20" (1/1) ... [2022-11-21 16:27:21,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:27:20" (1/1) ... [2022-11-21 16:27:21,076 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:27:20" (1/1) ... [2022-11-21 16:27:21,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:27:20" (1/1) ... [2022-11-21 16:27:21,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:27:21,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:27:21,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:27:21,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:27:21,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:27:20" (1/1) ... [2022-11-21 16:27:21,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:27:21,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:27:21,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:27:21,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:27:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:27:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:27:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:27:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:27:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:27:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:27:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 16:27:21,185 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 16:27:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 16:27:21,185 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 16:27:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 16:27:21,186 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 16:27:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:27:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:27:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:27:21,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:27:21,188 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:27:21,401 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:27:21,403 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:27:22,170 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:27:23,177 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:27:23,178 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:27:23,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:27:23 BoogieIcfgContainer [2022-11-21 16:27:23,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:27:23,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:27:23,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:27:23,192 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:27:23,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:27:20" (1/3) ... [2022-11-21 16:27:23,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4b8259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:27:23, skipping insertion in model container [2022-11-21 16:27:23,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:27:20" (2/3) ... [2022-11-21 16:27:23,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4b8259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:27:23, skipping insertion in model container [2022-11-21 16:27:23,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:27:23" (3/3) ... [2022-11-21 16:27:23,200 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_power.opt.i [2022-11-21 16:27:23,225 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:27:23,226 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2022-11-21 16:27:23,226 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:27:23,489 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:27:23,526 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 16:27:23,543 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 199 transitions, 413 flow [2022-11-21 16:27:23,546 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 199 transitions, 413 flow [2022-11-21 16:27:23,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 199 transitions, 413 flow [2022-11-21 16:27:23,659 INFO L130 PetriNetUnfolder]: 2/196 cut-off events. [2022-11-21 16:27:23,659 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:27:23,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 196 events. 2/196 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 382 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-11-21 16:27:23,676 INFO L119 LiptonReduction]: Number of co-enabled transitions 9720 [2022-11-21 16:27:41,432 WARN L233 SmtUtils]: Spent 7.07s on a formula simplification. DAG size of input: 241 DAG size of output: 239 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-21 16:27:50,492 WARN L233 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 285 DAG size of output: 282 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-21 16:28:16,130 INFO L134 LiptonReduction]: Checked pairs total: 43428 [2022-11-21 16:28:16,131 INFO L136 LiptonReduction]: Total number of compositions: 204 [2022-11-21 16:28:16,138 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 95 transitions, 205 flow [2022-11-21 16:28:20,361 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 141516 states, 89658 states have (on average 6.0174329117312455) internal successors, (539511), 141515 states have internal predecessors, (539511), 0 states have call successors, (0), 0 states 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:28:20,425 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:28:20,431 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;@51f5c591, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:28:20,432 INFO L358 AbstractCegarLoop]: Starting to check reachability of 109 error locations. [2022-11-21 16:28:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 141516 states, 89658 states have (on average 6.0174329117312455) internal successors, (539511), 141515 states have internal predecessors, (539511), 0 states have call successors, (0), 0 states 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:28:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 16:28:20,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:20,608 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 16:28:20,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:20,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1416, now seen corresponding path program 1 times [2022-11-21 16:28:20,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:20,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293689927] [2022-11-21 16:28:20,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:20,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:20,792 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:28:20,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:20,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293689927] [2022-11-21 16:28:20,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293689927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:20,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:20,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 16:28:20,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761161228] [2022-11-21 16:28:20,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:20,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:28:20,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:20,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:28:20,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:28:21,052 INFO L87 Difference]: Start difference. First operand has 141516 states, 89658 states have (on average 6.0174329117312455) internal successors, (539511), 141515 states have internal predecessors, (539511), 0 states have call successors, (0), 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:28:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:21,864 INFO L93 Difference]: Finished difference Result 14832 states and 53255 transitions. [2022-11-21 16:28:21,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:28:21,866 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:28:21,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:22,053 INFO L225 Difference]: With dead ends: 14832 [2022-11-21 16:28:22,054 INFO L226 Difference]: Without dead ends: 14832 [2022-11-21 16:28:22,055 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:28:22,058 INFO L413 NwaCegarLoop]: 4 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, 4 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:28:22,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:28:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14832 states. [2022-11-21 16:28:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14832 to 14832. [2022-11-21 16:28:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14832 states, 12754 states have (on average 4.175552767759134) internal successors, (53255), 14831 states have internal predecessors, (53255), 0 states have call successors, (0), 0 states 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:28:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14832 states to 14832 states and 53255 transitions. [2022-11-21 16:28:23,252 INFO L78 Accepts]: Start accepts. Automaton has 14832 states and 53255 transitions. Word has length 1 [2022-11-21 16:28:23,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:23,255 INFO L495 AbstractCegarLoop]: Abstraction has 14832 states and 53255 transitions. [2022-11-21 16:28:23,255 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:28:23,257 INFO L276 IsEmpty]: Start isEmpty. Operand 14832 states and 53255 transitions. [2022-11-21 16:28:23,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 16:28:23,258 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:23,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 16:28:23,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:28:23,260 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:23,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:23,261 INFO L85 PathProgramCache]: Analyzing trace with hash 43387852, now seen corresponding path program 1 times [2022-11-21 16:28:23,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:23,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361161014] [2022-11-21 16:28:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:23,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:23,508 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:28:23,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:23,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361161014] [2022-11-21 16:28:23,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361161014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:23,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:23,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:28:23,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966607500] [2022-11-21 16:28:23,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:23,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:28:23,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:23,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:28:23,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:28:23,525 INFO L87 Difference]: Start difference. First operand 14832 states and 53255 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:28:23,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:23,896 INFO L93 Difference]: Finished difference Result 10120 states and 32966 transitions. [2022-11-21 16:28:23,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:28:23,898 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:28:23,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:23,968 INFO L225 Difference]: With dead ends: 10120 [2022-11-21 16:28:23,968 INFO L226 Difference]: Without dead ends: 10116 [2022-11-21 16:28:23,970 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:28:23,972 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:23,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:28:24,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10116 states. [2022-11-21 16:28:24,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10116 to 9004. [2022-11-21 16:28:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9004 states, 8387 states have (on average 3.75843567425778) internal successors, (31522), 9003 states have internal predecessors, (31522), 0 states have call successors, (0), 0 states 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:28:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9004 states to 9004 states and 31522 transitions. [2022-11-21 16:28:24,573 INFO L78 Accepts]: Start accepts. Automaton has 9004 states and 31522 transitions. Word has length 4 [2022-11-21 16:28:24,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:24,574 INFO L495 AbstractCegarLoop]: Abstraction has 9004 states and 31522 transitions. [2022-11-21 16:28:24,574 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:28:24,574 INFO L276 IsEmpty]: Start isEmpty. Operand 9004 states and 31522 transitions. [2022-11-21 16:28:24,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 16:28:24,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:24,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 16:28:24,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:28:24,576 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:24,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:24,576 INFO L85 PathProgramCache]: Analyzing trace with hash 43387853, now seen corresponding path program 1 times [2022-11-21 16:28:24,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:24,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275506131] [2022-11-21 16:28:24,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:24,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:24,808 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:28:24,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:24,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275506131] [2022-11-21 16:28:24,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275506131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:24,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:24,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:28:24,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741167536] [2022-11-21 16:28:24,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:24,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:28:24,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:24,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:28:24,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:28:24,811 INFO L87 Difference]: Start difference. First operand 9004 states and 31522 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:28:24,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:24,977 INFO L93 Difference]: Finished difference Result 3090 states and 9603 transitions. [2022-11-21 16:28:24,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:28:24,978 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:28:24,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:25,087 INFO L225 Difference]: With dead ends: 3090 [2022-11-21 16:28:25,087 INFO L226 Difference]: Without dead ends: 3004 [2022-11-21 16:28:25,088 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:28:25,099 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:25,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:28:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2022-11-21 16:28:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 3004. [2022-11-21 16:28:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 2922 states have (on average 3.1830937713894594) internal successors, (9301), 3003 states have internal predecessors, (9301), 0 states have call successors, (0), 0 states 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:28:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 9301 transitions. [2022-11-21 16:28:25,195 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 9301 transitions. Word has length 4 [2022-11-21 16:28:25,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:25,195 INFO L495 AbstractCegarLoop]: Abstraction has 3004 states and 9301 transitions. [2022-11-21 16:28:25,195 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:28:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 9301 transitions. [2022-11-21 16:28:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:28:25,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:25,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:25,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:28:25,198 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:25,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:25,198 INFO L85 PathProgramCache]: Analyzing trace with hash -523653193, now seen corresponding path program 1 times [2022-11-21 16:28:25,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:25,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673616080] [2022-11-21 16:28:25,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:25,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:25,672 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:28:25,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:25,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673616080] [2022-11-21 16:28:25,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673616080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:25,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:25,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:28:25,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259910462] [2022-11-21 16:28:25,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:25,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:28:25,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:25,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:28:25,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:28:25,675 INFO L87 Difference]: Start difference. First operand 3004 states and 9301 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:28:25,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:25,855 INFO L93 Difference]: Finished difference Result 2989 states and 9244 transitions. [2022-11-21 16:28:25,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:28:25,855 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:28:25,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:25,871 INFO L225 Difference]: With dead ends: 2989 [2022-11-21 16:28:25,872 INFO L226 Difference]: Without dead ends: 2989 [2022-11-21 16:28:25,872 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:28:25,873 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:25,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 5 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:28:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2022-11-21 16:28:26,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2989. [2022-11-21 16:28:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2989 states, 2907 states have (on average 3.1799105607155145) internal successors, (9244), 2988 states have internal predecessors, (9244), 0 states have call successors, (0), 0 states 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:28:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 9244 transitions. [2022-11-21 16:28:26,107 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 9244 transitions. Word has length 11 [2022-11-21 16:28:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:26,108 INFO L495 AbstractCegarLoop]: Abstraction has 2989 states and 9244 transitions. [2022-11-21 16:28:26,109 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:28:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 9244 transitions. [2022-11-21 16:28:26,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 16:28:26,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:26,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:26,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:28:26,114 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:26,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:26,115 INFO L85 PathProgramCache]: Analyzing trace with hash 623518485, now seen corresponding path program 1 times [2022-11-21 16:28:26,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:26,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802753288] [2022-11-21 16:28:26,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:26,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:26,662 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:28:26,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:26,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802753288] [2022-11-21 16:28:26,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802753288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:26,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:26,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:28:26,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433597030] [2022-11-21 16:28:26,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:26,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:28:26,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:26,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:28:26,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:28:26,666 INFO L87 Difference]: Start difference. First operand 2989 states and 9244 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:28:26,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:26,857 INFO L93 Difference]: Finished difference Result 2944 states and 9088 transitions. [2022-11-21 16:28:26,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:28:26,858 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:28:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:26,875 INFO L225 Difference]: With dead ends: 2944 [2022-11-21 16:28:26,875 INFO L226 Difference]: Without dead ends: 2944 [2022-11-21 16:28:26,875 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:28:26,876 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:26,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 6 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:28:26,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2022-11-21 16:28:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2944. [2022-11-21 16:28:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2944 states, 2862 states have (on average 3.175401816911251) internal successors, (9088), 2943 states have internal predecessors, (9088), 0 states have call successors, (0), 0 states 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:28:26,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 9088 transitions. [2022-11-21 16:28:26,996 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 9088 transitions. Word has length 12 [2022-11-21 16:28:26,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:26,997 INFO L495 AbstractCegarLoop]: Abstraction has 2944 states and 9088 transitions. [2022-11-21 16:28:26,997 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:28:26,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 9088 transitions. [2022-11-21 16:28:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 16:28:26,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:26,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:26,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:28:27,000 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:27,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash 943459142, now seen corresponding path program 1 times [2022-11-21 16:28:27,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:27,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518228925] [2022-11-21 16:28:27,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:27,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:27,577 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:28:27,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:27,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518228925] [2022-11-21 16:28:27,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518228925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:27,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:27,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:28:27,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013801409] [2022-11-21 16:28:27,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:27,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:28:27,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:27,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:28:27,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:28:27,580 INFO L87 Difference]: Start difference. First operand 2944 states and 9088 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:28:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:27,761 INFO L93 Difference]: Finished difference Result 2939 states and 9069 transitions. [2022-11-21 16:28:27,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:28:27,762 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:28:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:27,776 INFO L225 Difference]: With dead ends: 2939 [2022-11-21 16:28:27,777 INFO L226 Difference]: Without dead ends: 2939 [2022-11-21 16:28:27,777 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:28:27,778 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:27,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:28:27,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2022-11-21 16:28:27,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2939. [2022-11-21 16:28:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2857 states have (on average 3.174308715435772) internal successors, (9069), 2938 states have internal predecessors, (9069), 0 states have call successors, (0), 0 states 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:28:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 9069 transitions. [2022-11-21 16:28:27,867 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 9069 transitions. Word has length 12 [2022-11-21 16:28:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:27,868 INFO L495 AbstractCegarLoop]: Abstraction has 2939 states and 9069 transitions. [2022-11-21 16:28:27,868 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:28:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 9069 transitions. [2022-11-21 16:28:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 16:28:27,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:27,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:27,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:28:27,870 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:27,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash 943458754, now seen corresponding path program 1 times [2022-11-21 16:28:27,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:27,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541337575] [2022-11-21 16:28:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:27,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:28:28,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:28,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541337575] [2022-11-21 16:28:28,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541337575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:28,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:28,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:28:28,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016565836] [2022-11-21 16:28:28,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:28,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:28:28,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:28,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:28:28,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:28:28,333 INFO L87 Difference]: Start difference. First operand 2939 states and 9069 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:28,518 INFO L93 Difference]: Finished difference Result 3383 states and 10143 transitions. [2022-11-21 16:28:28,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:28:28,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-21 16:28:28,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:28,534 INFO L225 Difference]: With dead ends: 3383 [2022-11-21 16:28:28,534 INFO L226 Difference]: Without dead ends: 3383 [2022-11-21 16:28:28,535 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:28:28,535 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 35 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:28,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 4 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:28:28,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states. [2022-11-21 16:28:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 2859. [2022-11-21 16:28:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2778 states have (on average 3.1695464362850974) internal successors, (8805), 2858 states have internal predecessors, (8805), 0 states have call successors, (0), 0 states 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:28:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 8805 transitions. [2022-11-21 16:28:28,620 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 8805 transitions. Word has length 12 [2022-11-21 16:28:28,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:28,621 INFO L495 AbstractCegarLoop]: Abstraction has 2859 states and 8805 transitions. [2022-11-21 16:28:28,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:28,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 8805 transitions. [2022-11-21 16:28:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 16:28:28,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:28,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:28,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:28:28,623 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:28,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:28,624 INFO L85 PathProgramCache]: Analyzing trace with hash 943458755, now seen corresponding path program 1 times [2022-11-21 16:28:28,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:28,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431051459] [2022-11-21 16:28:28,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:28,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:29,558 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:28:29,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:29,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431051459] [2022-11-21 16:28:29,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431051459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:29,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:29,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:28:29,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640943943] [2022-11-21 16:28:29,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:29,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:28:29,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:29,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:28:29,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:28:29,561 INFO L87 Difference]: Start difference. First operand 2859 states and 8805 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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:28:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:29,976 INFO L93 Difference]: Finished difference Result 3305 states and 9877 transitions. [2022-11-21 16:28:29,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:28:29,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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:28:29,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:29,992 INFO L225 Difference]: With dead ends: 3305 [2022-11-21 16:28:29,992 INFO L226 Difference]: Without dead ends: 3305 [2022-11-21 16:28:29,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:28:29,993 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 144 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:29,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 4 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:28:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2022-11-21 16:28:30,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 2779. [2022-11-21 16:28:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2779 states, 2699 states have (on average 3.1645053723601335) internal successors, (8541), 2778 states have internal predecessors, (8541), 0 states have call successors, (0), 0 states 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:28:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 8541 transitions. [2022-11-21 16:28:30,088 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 8541 transitions. Word has length 12 [2022-11-21 16:28:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:30,089 INFO L495 AbstractCegarLoop]: Abstraction has 2779 states and 8541 transitions. [2022-11-21 16:28:30,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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:28:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 8541 transitions. [2022-11-21 16:28:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 16:28:30,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:30,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:30,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:28:30,091 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:30,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2146042792, now seen corresponding path program 1 times [2022-11-21 16:28:30,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:30,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724720045] [2022-11-21 16:28:30,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:30,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:32,334 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:28:32,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:32,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724720045] [2022-11-21 16:28:32,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724720045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:32,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:32,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:28:32,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506414236] [2022-11-21 16:28:32,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:32,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:28:32,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:32,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:28:32,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:28:32,336 INFO L87 Difference]: Start difference. First operand 2779 states and 8541 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:32,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:32,935 INFO L93 Difference]: Finished difference Result 2772 states and 8515 transitions. [2022-11-21 16:28:32,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:28:32,936 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 16:28:32,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:32,949 INFO L225 Difference]: With dead ends: 2772 [2022-11-21 16:28:32,950 INFO L226 Difference]: Without dead ends: 2772 [2022-11-21 16:28:32,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:28:32,953 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 81 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:32,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 9 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:28:32,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2022-11-21 16:28:33,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2772. [2022-11-21 16:28:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2772 states, 2692 states have (on average 3.163075780089153) internal successors, (8515), 2771 states have internal predecessors, (8515), 0 states have call successors, (0), 0 states 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:28:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 8515 transitions. [2022-11-21 16:28:33,034 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 8515 transitions. Word has length 13 [2022-11-21 16:28:33,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:33,035 INFO L495 AbstractCegarLoop]: Abstraction has 2772 states and 8515 transitions. [2022-11-21 16:28:33,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:33,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 8515 transitions. [2022-11-21 16:28:33,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 16:28:33,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:33,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:33,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:28:33,037 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:33,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:33,037 INFO L85 PathProgramCache]: Analyzing trace with hash -719525377, now seen corresponding path program 1 times [2022-11-21 16:28:33,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:33,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035599343] [2022-11-21 16:28:33,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:33,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:33,308 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:28:33,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:33,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035599343] [2022-11-21 16:28:33,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035599343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:33,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:33,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:28:33,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434937026] [2022-11-21 16:28:33,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:33,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:28:33,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:33,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:28:33,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:28:33,312 INFO L87 Difference]: Start difference. First operand 2772 states and 8515 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:28:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:33,543 INFO L93 Difference]: Finished difference Result 2696 states and 7948 transitions. [2022-11-21 16:28:33,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:28:33,544 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:28:33,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:33,559 INFO L225 Difference]: With dead ends: 2696 [2022-11-21 16:28:33,559 INFO L226 Difference]: Without dead ends: 2696 [2022-11-21 16:28:33,559 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:28:33,560 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 45 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:33,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 6 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:28:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2022-11-21 16:28:33,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2380. [2022-11-21 16:28:33,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2300 states have (on average 3.141739130434783) internal successors, (7226), 2379 states have internal predecessors, (7226), 0 states have call successors, (0), 0 states 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:28:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 7226 transitions. [2022-11-21 16:28:33,658 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 7226 transitions. Word has length 13 [2022-11-21 16:28:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:33,659 INFO L495 AbstractCegarLoop]: Abstraction has 2380 states and 7226 transitions. [2022-11-21 16:28:33,659 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:28:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 7226 transitions. [2022-11-21 16:28:33,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:28:33,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:33,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:33,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:28:33,662 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:33,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:33,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1851571134, now seen corresponding path program 1 times [2022-11-21 16:28:33,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:33,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823202435] [2022-11-21 16:28:33,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:33,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:28:36,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:36,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823202435] [2022-11-21 16:28:36,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823202435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:36,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:36,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:28:36,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434483245] [2022-11-21 16:28:36,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:36,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:28:36,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:36,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:28:36,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:28:36,340 INFO L87 Difference]: Start difference. First operand 2380 states and 7226 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:28:37,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:37,156 INFO L93 Difference]: Finished difference Result 2275 states and 6719 transitions. [2022-11-21 16:28:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:28:37,157 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:28:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:37,169 INFO L225 Difference]: With dead ends: 2275 [2022-11-21 16:28:37,170 INFO L226 Difference]: Without dead ends: 2275 [2022-11-21 16:28:37,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:28:37,171 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 65 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:37,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 13 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 16:28:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2022-11-21 16:28:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2241. [2022-11-21 16:28:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 2165 states have (on average 3.0706697459584293) internal successors, (6648), 2240 states have internal predecessors, (6648), 0 states have call successors, (0), 0 states 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:28:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 6648 transitions. [2022-11-21 16:28:37,256 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 6648 transitions. Word has length 14 [2022-11-21 16:28:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:37,256 INFO L495 AbstractCegarLoop]: Abstraction has 2241 states and 6648 transitions. [2022-11-21 16:28:37,256 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:28:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 6648 transitions. [2022-11-21 16:28:37,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:28:37,258 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:37,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:37,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:28:37,259 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:37,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:37,260 INFO L85 PathProgramCache]: Analyzing trace with hash 256492609, now seen corresponding path program 1 times [2022-11-21 16:28:37,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:37,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177191608] [2022-11-21 16:28:37,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:37,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:37,719 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:28:37,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:37,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177191608] [2022-11-21 16:28:37,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177191608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:37,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:37,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:28:37,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25069625] [2022-11-21 16:28:37,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:37,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:28:37,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:37,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:28:37,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:28:37,723 INFO L87 Difference]: Start difference. First operand 2241 states and 6648 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:28:37,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:37,905 INFO L93 Difference]: Finished difference Result 3200 states and 9345 transitions. [2022-11-21 16:28:37,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:28:37,906 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:28:37,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:37,922 INFO L225 Difference]: With dead ends: 3200 [2022-11-21 16:28:37,922 INFO L226 Difference]: Without dead ends: 3200 [2022-11-21 16:28:37,922 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:28:37,923 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:37,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 7 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:28:37,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2022-11-21 16:28:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2363. [2022-11-21 16:28:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2287 states have (on average 3.073458679492785) internal successors, (7029), 2362 states have internal predecessors, (7029), 0 states have call successors, (0), 0 states 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:28:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 7029 transitions. [2022-11-21 16:28:38,012 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 7029 transitions. Word has length 14 [2022-11-21 16:28:38,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:38,013 INFO L495 AbstractCegarLoop]: Abstraction has 2363 states and 7029 transitions. [2022-11-21 16:28:38,013 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:28:38,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 7029 transitions. [2022-11-21 16:28:38,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:28:38,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:38,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:38,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 16:28:38,015 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:38,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:38,016 INFO L85 PathProgramCache]: Analyzing trace with hash -830447080, now seen corresponding path program 1 times [2022-11-21 16:28:38,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:38,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9648825] [2022-11-21 16:28:38,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:38,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:38,404 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:28:38,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:38,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9648825] [2022-11-21 16:28:38,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9648825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:38,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:38,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:28:38,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988051082] [2022-11-21 16:28:38,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:38,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:28:38,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:38,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:28:38,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:28:38,408 INFO L87 Difference]: Start difference. First operand 2363 states and 7029 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:28:38,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:38,746 INFO L93 Difference]: Finished difference Result 2227 states and 5948 transitions. [2022-11-21 16:28:38,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:28:38,747 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:28:38,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:38,757 INFO L225 Difference]: With dead ends: 2227 [2022-11-21 16:28:38,757 INFO L226 Difference]: Without dead ends: 2227 [2022-11-21 16:28:38,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:28:38,759 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 109 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:38,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 7 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:28:38,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2022-11-21 16:28:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1903. [2022-11-21 16:28:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1827 states have (on average 2.808976464148878) internal successors, (5132), 1902 states have internal predecessors, (5132), 0 states have call successors, (0), 0 states 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:28:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 5132 transitions. [2022-11-21 16:28:38,831 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 5132 transitions. Word has length 14 [2022-11-21 16:28:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:38,832 INFO L495 AbstractCegarLoop]: Abstraction has 1903 states and 5132 transitions. [2022-11-21 16:28:38,832 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:28:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 5132 transitions. [2022-11-21 16:28:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:28:38,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:38,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:38,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:28:38,835 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:38,835 INFO L85 PathProgramCache]: Analyzing trace with hash -830446943, now seen corresponding path program 1 times [2022-11-21 16:28:38,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:38,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805965051] [2022-11-21 16:28:38,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:38,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:39,412 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:28:39,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:39,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805965051] [2022-11-21 16:28:39,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805965051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:39,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:39,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:28:39,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557323012] [2022-11-21 16:28:39,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:39,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:28:39,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:39,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:28:39,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:28:39,415 INFO L87 Difference]: Start difference. First operand 1903 states and 5132 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:28:40,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:40,142 INFO L93 Difference]: Finished difference Result 1331 states and 3711 transitions. [2022-11-21 16:28:40,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:28:40,143 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:28:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:40,149 INFO L225 Difference]: With dead ends: 1331 [2022-11-21 16:28:40,149 INFO L226 Difference]: Without dead ends: 1283 [2022-11-21 16:28:40,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:28:40,150 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 57 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:40,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 17 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 16:28:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2022-11-21 16:28:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2022-11-21 16:28:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1245 states have (on average 2.8265060240963855) internal successors, (3519), 1282 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states 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:28:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 3519 transitions. [2022-11-21 16:28:40,192 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 3519 transitions. Word has length 14 [2022-11-21 16:28:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:40,192 INFO L495 AbstractCegarLoop]: Abstraction has 1283 states and 3519 transitions. [2022-11-21 16:28:40,192 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:28:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 3519 transitions. [2022-11-21 16:28:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 16:28:40,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:40,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:40,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:28:40,195 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:40,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash 347223592, now seen corresponding path program 1 times [2022-11-21 16:28:40,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:40,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857246199] [2022-11-21 16:28:40,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:40,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:40,559 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:28:40,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:40,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857246199] [2022-11-21 16:28:40,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857246199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:40,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:40,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:28:40,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307082991] [2022-11-21 16:28:40,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:40,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:28:40,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:40,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:28:40,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:28:40,562 INFO L87 Difference]: Start difference. First operand 1283 states and 3519 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:28:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:40,689 INFO L93 Difference]: Finished difference Result 671 states and 1582 transitions. [2022-11-21 16:28:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:28:40,689 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:28:40,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:40,692 INFO L225 Difference]: With dead ends: 671 [2022-11-21 16:28:40,692 INFO L226 Difference]: Without dead ends: 671 [2022-11-21 16:28:40,692 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:28:40,693 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:40,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 6 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:28:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-11-21 16:28:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2022-11-21 16:28:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 644 states have (on average 2.4565217391304346) internal successors, (1582), 670 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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:28:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1582 transitions. [2022-11-21 16:28:40,712 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1582 transitions. Word has length 15 [2022-11-21 16:28:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:40,712 INFO L495 AbstractCegarLoop]: Abstraction has 671 states and 1582 transitions. [2022-11-21 16:28:40,712 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:28:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1582 transitions. [2022-11-21 16:28:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:28:40,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:40,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:40,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:28:40,714 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:40,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:40,715 INFO L85 PathProgramCache]: Analyzing trace with hash 426635822, now seen corresponding path program 1 times [2022-11-21 16:28:40,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:40,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145570249] [2022-11-21 16:28:40,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:40,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:28:44,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:44,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145570249] [2022-11-21 16:28:44,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145570249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:44,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:44,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:28:44,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127076542] [2022-11-21 16:28:44,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:44,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:28:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:44,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:28:44,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:28:44,783 INFO L87 Difference]: Start difference. First operand 671 states and 1582 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:45,310 INFO L93 Difference]: Finished difference Result 663 states and 1564 transitions. [2022-11-21 16:28:45,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:28:45,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 16:28:45,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:45,313 INFO L225 Difference]: With dead ends: 663 [2022-11-21 16:28:45,313 INFO L226 Difference]: Without dead ends: 663 [2022-11-21 16:28:45,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:28:45,314 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 65 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:45,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 10 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:28:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-11-21 16:28:45,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2022-11-21 16:28:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 636 states have (on average 2.459119496855346) internal successors, (1564), 662 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states 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:28:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1564 transitions. [2022-11-21 16:28:45,329 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1564 transitions. Word has length 16 [2022-11-21 16:28:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:45,330 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 1564 transitions. [2022-11-21 16:28:45,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1564 transitions. [2022-11-21 16:28:45,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:28:45,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:45,331 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:28:45,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 16:28:45,332 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:45,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:45,339 INFO L85 PathProgramCache]: Analyzing trace with hash -17345945, now seen corresponding path program 1 times [2022-11-21 16:28:45,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:45,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817587435] [2022-11-21 16:28:45,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:45,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:45,782 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:28:45,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:45,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817587435] [2022-11-21 16:28:45,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817587435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:45,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:45,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:28:45,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169732011] [2022-11-21 16:28:45,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:45,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:28:45,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:45,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:28:45,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:28:45,786 INFO L87 Difference]: Start difference. First operand 663 states and 1564 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:28:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:45,969 INFO L93 Difference]: Finished difference Result 293 states and 620 transitions. [2022-11-21 16:28:45,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:28:45,970 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:28:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:45,971 INFO L225 Difference]: With dead ends: 293 [2022-11-21 16:28:45,971 INFO L226 Difference]: Without dead ends: 293 [2022-11-21 16:28:45,971 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:28:45,972 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:45,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 9 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:28:45,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-21 16:28:45,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2022-11-21 16:28:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 284 states have (on average 2.183098591549296) internal successors, (620), 292 states have internal predecessors, (620), 0 states have call successors, (0), 0 states 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:28:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 620 transitions. [2022-11-21 16:28:45,982 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 620 transitions. Word has length 17 [2022-11-21 16:28:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:45,982 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 620 transitions. [2022-11-21 16:28:45,983 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:28:45,983 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 620 transitions. [2022-11-21 16:28:45,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:28:45,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:45,984 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:28:45,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 16:28:45,985 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:45,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:45,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1932616718, now seen corresponding path program 1 times [2022-11-21 16:28:45,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:45,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362679449] [2022-11-21 16:28:45,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:45,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:46,576 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:28:46,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:46,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362679449] [2022-11-21 16:28:46,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362679449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:46,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:46,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:28:46,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009884104] [2022-11-21 16:28:46,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:46,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:28:46,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:46,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:28:46,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:28:46,580 INFO L87 Difference]: Start difference. First operand 293 states and 620 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:28:46,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:46,734 INFO L93 Difference]: Finished difference Result 214 states and 486 transitions. [2022-11-21 16:28:46,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:28:46,735 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:28:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:46,735 INFO L225 Difference]: With dead ends: 214 [2022-11-21 16:28:46,736 INFO L226 Difference]: Without dead ends: 93 [2022-11-21 16:28:46,736 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:28:46,736 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 49 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:46,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 6 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:28:46,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-21 16:28:46,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-21 16:28:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.0217391304347827) internal successors, (186), 92 states have internal predecessors, (186), 0 states have call successors, (0), 0 states 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:28:46,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 186 transitions. [2022-11-21 16:28:46,740 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 186 transitions. Word has length 19 [2022-11-21 16:28:46,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:46,740 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 186 transitions. [2022-11-21 16:28:46,740 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:28:46,740 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 186 transitions. [2022-11-21 16:28:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:28:46,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:46,741 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:28:46,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 16:28:46,741 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:46,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:46,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1562069386, now seen corresponding path program 1 times [2022-11-21 16:28:46,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:46,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209490034] [2022-11-21 16:28:46,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:46,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:52,929 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:28:52,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:52,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209490034] [2022-11-21 16:28:52,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209490034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:52,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:52,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 16:28:52,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064721644] [2022-11-21 16:28:52,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:52,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 16:28:52,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:52,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 16:28:52,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:28:52,931 INFO L87 Difference]: Start difference. First operand 93 states and 186 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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 16:28:53,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:53,392 INFO L93 Difference]: Finished difference Result 113 states and 221 transitions. [2022-11-21 16:28:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:28:53,393 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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 16:28:53,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:53,393 INFO L225 Difference]: With dead ends: 113 [2022-11-21 16:28:53,394 INFO L226 Difference]: Without dead ends: 60 [2022-11-21 16:28:53,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:28:53,394 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 48 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:53,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 8 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:28:53,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-21 16:28:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-11-21 16:28:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.8305084745762712) internal successors, (108), 59 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:28:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 108 transitions. [2022-11-21 16:28:53,397 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 108 transitions. Word has length 22 [2022-11-21 16:28:53,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:53,397 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 108 transitions. [2022-11-21 16:28:53,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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 16:28:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 108 transitions. [2022-11-21 16:28:53,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:28:53,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:53,399 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:28:53,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 16:28:53,399 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash -456044558, now seen corresponding path program 2 times [2022-11-21 16:28:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:53,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867297578] [2022-11-21 16:28:53,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:53,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:56,547 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:28:56,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:56,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867297578] [2022-11-21 16:28:56,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867297578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:56,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:56,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:28:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932768068] [2022-11-21 16:28:56,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:56,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 16:28:56,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:56,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 16:28:56,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:28:56,549 INFO L87 Difference]: Start difference. First operand 60 states and 108 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 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 16:28:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:57,073 INFO L93 Difference]: Finished difference Result 86 states and 156 transitions. [2022-11-21 16:28:57,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:28:57,074 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 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 16:28:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:57,074 INFO L225 Difference]: With dead ends: 86 [2022-11-21 16:28:57,074 INFO L226 Difference]: Without dead ends: 49 [2022-11-21 16:28:57,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:28:57,076 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:57,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 6 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:28:57,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-21 16:28:57,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-21 16:28:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 48 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:28:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 82 transitions. [2022-11-21 16:28:57,078 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 82 transitions. Word has length 22 [2022-11-21 16:28:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:57,078 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 82 transitions. [2022-11-21 16:28:57,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 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 16:28:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 82 transitions. [2022-11-21 16:28:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:28:57,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:57,080 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:28:57,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 16:28:57,080 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:28:57,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:57,080 INFO L85 PathProgramCache]: Analyzing trace with hash 286449078, now seen corresponding path program 3 times [2022-11-21 16:28:57,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:57,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269083881] [2022-11-21 16:28:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:57,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:28:57,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:28:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:28:57,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:28:57,599 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:28:57,600 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (108 of 109 remaining) [2022-11-21 16:28:57,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 109 remaining) [2022-11-21 16:28:57,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 109 remaining) [2022-11-21 16:28:57,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 109 remaining) [2022-11-21 16:28:57,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 109 remaining) [2022-11-21 16:28:57,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 109 remaining) [2022-11-21 16:28:57,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 109 remaining) [2022-11-21 16:28:57,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 109 remaining) [2022-11-21 16:28:57,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 109 remaining) [2022-11-21 16:28:57,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 109 remaining) [2022-11-21 16:28:57,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 109 remaining) [2022-11-21 16:28:57,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 109 remaining) [2022-11-21 16:28:57,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 109 remaining) [2022-11-21 16:28:57,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 109 remaining) [2022-11-21 16:28:57,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 109 remaining) [2022-11-21 16:28:57,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 109 remaining) [2022-11-21 16:28:57,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 109 remaining) [2022-11-21 16:28:57,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 109 remaining) [2022-11-21 16:28:57,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 109 remaining) [2022-11-21 16:28:57,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 109 remaining) [2022-11-21 16:28:57,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 109 remaining) [2022-11-21 16:28:57,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 109 remaining) [2022-11-21 16:28:57,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 109 remaining) [2022-11-21 16:28:57,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 109 remaining) [2022-11-21 16:28:57,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 109 remaining) [2022-11-21 16:28:57,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 109 remaining) [2022-11-21 16:28:57,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 109 remaining) [2022-11-21 16:28:57,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 109 remaining) [2022-11-21 16:28:57,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 109 remaining) [2022-11-21 16:28:57,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 109 remaining) [2022-11-21 16:28:57,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 109 remaining) [2022-11-21 16:28:57,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 109 remaining) [2022-11-21 16:28:57,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 109 remaining) [2022-11-21 16:28:57,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 109 remaining) [2022-11-21 16:28:57,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 109 remaining) [2022-11-21 16:28:57,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 109 remaining) [2022-11-21 16:28:57,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 109 remaining) [2022-11-21 16:28:57,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 109 remaining) [2022-11-21 16:28:57,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 109 remaining) [2022-11-21 16:28:57,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 109 remaining) [2022-11-21 16:28:57,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 109 remaining) [2022-11-21 16:28:57,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 109 remaining) [2022-11-21 16:28:57,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 109 remaining) [2022-11-21 16:28:57,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 109 remaining) [2022-11-21 16:28:57,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 109 remaining) [2022-11-21 16:28:57,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 109 remaining) [2022-11-21 16:28:57,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 109 remaining) [2022-11-21 16:28:57,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 109 remaining) [2022-11-21 16:28:57,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 109 remaining) [2022-11-21 16:28:57,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 109 remaining) [2022-11-21 16:28:57,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 109 remaining) [2022-11-21 16:28:57,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 109 remaining) [2022-11-21 16:28:57,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 109 remaining) [2022-11-21 16:28:57,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 109 remaining) [2022-11-21 16:28:57,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 109 remaining) [2022-11-21 16:28:57,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 109 remaining) [2022-11-21 16:28:57,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 109 remaining) [2022-11-21 16:28:57,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 109 remaining) [2022-11-21 16:28:57,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 109 remaining) [2022-11-21 16:28:57,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 109 remaining) [2022-11-21 16:28:57,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 109 remaining) [2022-11-21 16:28:57,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 109 remaining) [2022-11-21 16:28:57,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 109 remaining) [2022-11-21 16:28:57,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 109 remaining) [2022-11-21 16:28:57,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 109 remaining) [2022-11-21 16:28:57,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (43 of 109 remaining) [2022-11-21 16:28:57,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 109 remaining) [2022-11-21 16:28:57,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 109 remaining) [2022-11-21 16:28:57,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 109 remaining) [2022-11-21 16:28:57,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 109 remaining) [2022-11-21 16:28:57,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 109 remaining) [2022-11-21 16:28:57,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 109 remaining) [2022-11-21 16:28:57,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 109 remaining) [2022-11-21 16:28:57,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 109 remaining) [2022-11-21 16:28:57,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 109 remaining) [2022-11-21 16:28:57,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 109 remaining) [2022-11-21 16:28:57,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 109 remaining) [2022-11-21 16:28:57,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 109 remaining) [2022-11-21 16:28:57,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 109 remaining) [2022-11-21 16:28:57,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 109 remaining) [2022-11-21 16:28:57,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 109 remaining) [2022-11-21 16:28:57,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 109 remaining) [2022-11-21 16:28:57,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 109 remaining) [2022-11-21 16:28:57,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 109 remaining) [2022-11-21 16:28:57,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 109 remaining) [2022-11-21 16:28:57,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 109 remaining) [2022-11-21 16:28:57,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 109 remaining) [2022-11-21 16:28:57,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 109 remaining) [2022-11-21 16:28:57,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 109 remaining) [2022-11-21 16:28:57,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 109 remaining) [2022-11-21 16:28:57,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 109 remaining) [2022-11-21 16:28:57,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 109 remaining) [2022-11-21 16:28:57,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 109 remaining) [2022-11-21 16:28:57,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 109 remaining) [2022-11-21 16:28:57,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 109 remaining) [2022-11-21 16:28:57,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 109 remaining) [2022-11-21 16:28:57,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 109 remaining) [2022-11-21 16:28:57,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 109 remaining) [2022-11-21 16:28:57,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 109 remaining) [2022-11-21 16:28:57,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 109 remaining) [2022-11-21 16:28:57,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 109 remaining) [2022-11-21 16:28:57,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 109 remaining) [2022-11-21 16:28:57,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 109 remaining) [2022-11-21 16:28:57,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 109 remaining) [2022-11-21 16:28:57,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 109 remaining) [2022-11-21 16:28:57,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 109 remaining) [2022-11-21 16:28:57,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 109 remaining) [2022-11-21 16:28:57,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 109 remaining) [2022-11-21 16:28:57,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 109 remaining) [2022-11-21 16:28:57,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 16:28:57,639 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:57,646 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 16:28:57,646 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:28:57,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:28:57 BasicIcfg [2022-11-21 16:28:57,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:28:57,783 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:28:57,784 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:28:57,784 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:28:57,785 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:27:23" (3/4) ... [2022-11-21 16:28:57,788 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 16:28:57,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:28:57,789 INFO L158 Benchmark]: Toolchain (without parser) took 97763.21ms. Allocated memory was 151.0MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 104.7MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 793.2MB. Max. memory is 16.1GB. [2022-11-21 16:28:57,789 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 151.0MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:28:57,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 884.48ms. Allocated memory is still 151.0MB. Free memory was 104.7MB in the beginning and 77.5MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-21 16:28:57,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.68ms. Allocated memory is still 151.0MB. Free memory was 77.5MB in the beginning and 74.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:28:57,791 INFO L158 Benchmark]: Boogie Preprocessor took 74.75ms. Allocated memory is still 151.0MB. Free memory was 74.6MB in the beginning and 72.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 16:28:57,791 INFO L158 Benchmark]: RCFGBuilder took 2098.19ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 71.6MB in the beginning and 85.8MB in the end (delta: -14.1MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2022-11-21 16:28:57,791 INFO L158 Benchmark]: TraceAbstraction took 94595.05ms. Allocated memory was 195.0MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 84.7MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 727.8MB. Max. memory is 16.1GB. [2022-11-21 16:28:57,792 INFO L158 Benchmark]: Witness Printer took 5.16ms. Allocated memory is still 4.4GB. Free memory is still 3.5GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:28:57,794 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 151.0MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 884.48ms. Allocated memory is still 151.0MB. Free memory was 104.7MB in the beginning and 77.5MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.68ms. Allocated memory is still 151.0MB. Free memory was 77.5MB in the beginning and 74.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.75ms. Allocated memory is still 151.0MB. Free memory was 74.6MB in the beginning and 72.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2098.19ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 71.6MB in the beginning and 85.8MB in the end (delta: -14.1MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. * TraceAbstraction took 94595.05ms. Allocated memory was 195.0MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 84.7MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 727.8MB. Max. memory is 16.1GB. * Witness Printer took 5.16ms. Allocated memory is still 4.4GB. Free memory is still 3.5GB. 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: 52.6s, 207 PlacesBefore, 104 PlacesAfterwards, 199 TransitionsBefore, 95 TransitionsAfterwards, 9720 CoEnabledTransitionPairs, 7 FixpointIterations, 72 TrivialSequentialCompositions, 125 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 204 TotalNumberOfCompositions, 43428 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17383, independent: 16831, independent conditional: 0, independent unconditional: 16831, dependent: 409, dependent conditional: 0, dependent unconditional: 409, unknown: 143, unknown conditional: 0, unknown unconditional: 143] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7061, independent: 6951, independent conditional: 0, independent unconditional: 6951, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7061, independent: 5359, independent conditional: 0, independent unconditional: 5359, dependent: 1702, dependent conditional: 0, dependent unconditional: 1702, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1702, independent: 1592, independent conditional: 0, independent unconditional: 1592, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8599, independent: 7554, independent conditional: 0, independent unconditional: 7554, dependent: 765, dependent conditional: 0, dependent unconditional: 765, unknown: 280, unknown conditional: 0, unknown unconditional: 280] ], Cache Queries: [ total: 17383, independent: 9880, independent conditional: 0, independent unconditional: 9880, dependent: 315, dependent conditional: 0, dependent unconditional: 315, unknown: 7188, unknown conditional: 0, unknown unconditional: 7188] , Statistics on independence cache: Total cache size (in pairs): 1156, Positive cache size: 1123, Positive conditional cache size: 0, Positive unconditional cache size: 1123, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 9, Unknown conditional cache size: 0, Unknown unconditional cache size: 9 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L853] 0 pthread_t t2124; [L854] FCALL, FORK 0 pthread_create(&t2124, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2124, ((void *)0), P0, ((void *)0))=-2, t2124={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] [L855] 0 pthread_t t2125; [L856] FCALL, FORK 0 pthread_create(&t2125, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2125, ((void *)0), P1, ((void *)0))=-1, t2124={7:0}, t2125={8: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] [L857] 0 pthread_t t2126; [L858] FCALL, FORK 0 pthread_create(&t2126, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2126, ((void *)0), P2, ((void *)0))=0, t2124={7:0}, t2125={8:0}, t2126={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] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L814] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L814] EXPR 3 \read(x) [L814] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L814] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L815] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L816] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L817] 3 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_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L818] 3 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_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L819] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L820] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L821] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L822] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L823] EXPR 3 \read(x) [L823] 3 __unbuffered_p2_EAX = x [L824] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L824] EXPR 3 \read(x) [L824] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L824] 3 x = x$flush_delayed ? x$mem_tmp : x [L825] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_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=255, 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] [L828] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_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=255, 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] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=255, 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] [L831] 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) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] 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) [L831] 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) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 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 [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 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_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=255, 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] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=6, weak$$choice1=255, weak$$choice2=255, 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] [L789] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_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=6, weak$$choice1=255, weak$$choice2=255, 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] [L792] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_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=6, weak$$choice1=255, weak$$choice2=255, 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] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L795] 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) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 \read(x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] 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) [L795] 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) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_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=6, weak$$choice1=255, weak$$choice2=255, 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] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] 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) [L864] 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) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 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 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_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=1, main$tmp_guard1=0, t2124={7:0}, t2125={8:0}, t2126={5:0}, weak$$choice0=6, weak$$choice1=255, weak$$choice2=255, 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] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(x) [L874] 0 x$mem_tmp = x [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] EXPR 0 \read(x) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L883] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L883] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] EXPR 0 \read(x) [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2) [L885] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=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] - 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: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 264 locations, 109 error locations. Started 1 CEGAR loops. OverallTime: 94.1s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.2s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 56.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 927 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 927 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 337 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2550 IncrementalHoareTripleChecker+Invalid, 2887 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 337 mSolverCounterUnsat, 53 mSDtfsCounter, 2550 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141516occurred in iteration=0, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 3673 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 241 ConstructedInterpolants, 0 QuantifiedInterpolants, 3624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-21 16:28:57,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe015_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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_ab93050f-362b-4892-a1ad-749415b96d87/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 7ed03bf56a68b0ba240fc33c794b8871860875fa75320178f23c03b98fa54cab --- 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:29:00,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:29:00,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:29:00,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:29:00,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:29:00,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:29:00,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:29:00,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:29:00,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:29:00,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:29:00,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:29:00,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:29:00,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:29:00,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:29:00,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:29:00,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:29:00,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:29:00,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:29:00,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:29:00,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:29:00,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:29:00,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:29:00,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:29:00,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:29:00,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:29:00,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:29:00,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:29:00,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:29:00,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:29:00,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:29:00,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:29:00,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:29:00,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:29:00,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:29:00,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:29:00,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:29:00,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:29:00,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:29:00,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:29:00,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:29:00,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:29:00,883 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-21 16:29:00,933 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:29:00,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:29:00,936 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:29:00,937 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:29:00,938 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:29:00,938 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:29:00,939 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:29:00,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:29:00,939 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:29:00,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:29:00,941 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:29:00,941 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:29:00,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:29:00,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:29:00,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:29:00,942 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:29:00,942 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:29:00,943 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:29:00,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:29:00,943 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:29:00,943 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 16:29:00,943 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 16:29:00,944 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:29:00,944 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:29:00,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:29:00,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:29:00,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:29:00,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:29:00,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:29:00,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:29:00,946 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 16:29:00,946 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 16:29:00,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 16:29:00,947 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_ab93050f-362b-4892-a1ad-749415b96d87/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_ab93050f-362b-4892-a1ad-749415b96d87/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 -> 7ed03bf56a68b0ba240fc33c794b8871860875fa75320178f23c03b98fa54cab [2022-11-21 16:29:01,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:29:01,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:29:01,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:29:01,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:29:01,405 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:29:01,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe015_power.opt.i [2022-11-21 16:29:04,581 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:29:04,914 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:29:04,914 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/sv-benchmarks/c/pthread-wmm/safe015_power.opt.i [2022-11-21 16:29:04,941 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/data/7161c3e59/fd42f14ccb4d42f0b94a1039c3e15a59/FLAG5af1cf7b1 [2022-11-21 16:29:04,958 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/data/7161c3e59/fd42f14ccb4d42f0b94a1039c3e15a59 [2022-11-21 16:29:04,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:29:04,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:29:04,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:29:04,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:29:04,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:29:04,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:29:04" (1/1) ... [2022-11-21 16:29:04,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1748f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:04, skipping insertion in model container [2022-11-21 16:29:04,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:29:04" (1/1) ... [2022-11-21 16:29:04,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:29:05,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:29:05,251 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_ab93050f-362b-4892-a1ad-749415b96d87/sv-benchmarks/c/pthread-wmm/safe015_power.opt.i[994,1007] [2022-11-21 16:29:05,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:29:05,626 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:29:05,666 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_ab93050f-362b-4892-a1ad-749415b96d87/sv-benchmarks/c/pthread-wmm/safe015_power.opt.i[994,1007] [2022-11-21 16:29:05,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:29:05,855 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:29:05,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:05 WrapperNode [2022-11-21 16:29:05,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:29:05,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:29:05,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:29:05,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:29:05,869 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:29:05" (1/1) ... [2022-11-21 16:29:05,897 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:29:05" (1/1) ... [2022-11-21 16:29:05,926 INFO L138 Inliner]: procedures = 180, calls = 86, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2022-11-21 16:29:05,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:29:05,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:29:05,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:29:05,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:29:05,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:05" (1/1) ... [2022-11-21 16:29:05,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:05" (1/1) ... [2022-11-21 16:29:05,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:05" (1/1) ... [2022-11-21 16:29:05,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:05" (1/1) ... [2022-11-21 16:29:05,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:05" (1/1) ... [2022-11-21 16:29:05,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:05" (1/1) ... [2022-11-21 16:29:05,995 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:05" (1/1) ... [2022-11-21 16:29:05,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:05" (1/1) ... [2022-11-21 16:29:06,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:29:06,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:29:06,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:29:06,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:29:06,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:05" (1/1) ... [2022-11-21 16:29:06,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:29:06,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:29:06,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:29:06,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:29:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-21 16:29:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:29:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:29:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:29:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:29:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-21 16:29:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-21 16:29:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-21 16:29:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 16:29:06,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 16:29:06,132 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 16:29:06,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 16:29:06,132 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 16:29:06,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 16:29:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:29:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:29:06,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:29:06,135 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:29:06,395 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:29:06,398 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:29:07,356 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:29:08,867 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:29:08,868 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:29:08,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:29:08 BoogieIcfgContainer [2022-11-21 16:29:08,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:29:08,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:29:08,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:29:08,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:29:08,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:29:04" (1/3) ... [2022-11-21 16:29:08,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18726c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:29:08, skipping insertion in model container [2022-11-21 16:29:08,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:05" (2/3) ... [2022-11-21 16:29:08,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18726c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:29:08, skipping insertion in model container [2022-11-21 16:29:08,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:29:08" (3/3) ... [2022-11-21 16:29:08,884 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_power.opt.i [2022-11-21 16:29:08,907 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:29:08,907 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2022-11-21 16:29:08,907 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:29:09,178 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:29:09,224 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 16:29:09,252 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 200 transitions, 415 flow [2022-11-21 16:29:09,274 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 200 transitions, 415 flow [2022-11-21 16:29:09,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 200 transitions, 415 flow [2022-11-21 16:29:09,389 INFO L130 PetriNetUnfolder]: 2/197 cut-off events. [2022-11-21 16:29:09,389 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:29:09,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 197 events. 2/197 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 382 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-11-21 16:29:09,404 INFO L119 LiptonReduction]: Number of co-enabled transitions 9720 [2022-11-21 16:30:10,394 WARN L233 SmtUtils]: Spent 38.59s on a formula simplification. DAG size of input: 237 DAG size of output: 233 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-21 16:30:23,497 WARN L233 SmtUtils]: Spent 13.10s on a formula simplification that was a NOOP. DAG size: 233 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-21 16:31:31,167 WARN L233 SmtUtils]: Spent 1.13m on a formula simplification. DAG size of input: 281 DAG size of output: 277 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-21 16:31:48,217 WARN L233 SmtUtils]: Spent 17.05s on a formula simplification that was a NOOP. DAG size: 277 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-21 16:32:37,845 INFO L134 LiptonReduction]: Checked pairs total: 43330 [2022-11-21 16:32:37,846 INFO L136 LiptonReduction]: Total number of compositions: 205 [2022-11-21 16:32:37,856 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 95 transitions, 205 flow [2022-11-21 16:32:42,908 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 141516 states, 89658 states have (on average 6.0174329117312455) internal successors, (539511), 141515 states have internal predecessors, (539511), 0 states have call successors, (0), 0 states 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:32:42,970 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:32:42,976 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;@2e5ca109, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:32:42,976 INFO L358 AbstractCegarLoop]: Starting to check reachability of 109 error locations. [2022-11-21 16:32:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 141516 states, 89658 states have (on average 6.0174329117312455) internal successors, (539511), 141515 states have internal predecessors, (539511), 0 states have call successors, (0), 0 states 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:32:43,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 16:32:43,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:32:43,296 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 16:32:43,297 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:32:43,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:32:43,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1420, now seen corresponding path program 1 times [2022-11-21 16:32:43,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:32:43,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900294043] [2022-11-21 16:32:43,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:32:43,352 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:32:43,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:32:43,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:43,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:32:44,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 16:32:44,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:32:44,389 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:32:44,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:32:44,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:32:44,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900294043] [2022-11-21 16:32:44,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900294043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:32:44,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:32:44,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 16:32:44,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339748925] [2022-11-21 16:32:44,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:32:44,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:32:44,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:32:44,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:32:44,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:32:44,758 INFO L87 Difference]: Start difference. First operand has 141516 states, 89658 states have (on average 6.0174329117312455) internal successors, (539511), 141515 states have internal predecessors, (539511), 0 states have call successors, (0), 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:32:45,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:32:45,921 INFO L93 Difference]: Finished difference Result 14832 states and 53255 transitions. [2022-11-21 16:32:45,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:32:45,924 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:32:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:32:46,132 INFO L225 Difference]: With dead ends: 14832 [2022-11-21 16:32:46,133 INFO L226 Difference]: Without dead ends: 14832 [2022-11-21 16:32:46,134 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:32:46,144 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 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.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:32:46,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:32:46,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14832 states. [2022-11-21 16:32:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14832 to 14832. [2022-11-21 16:32:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14832 states, 12754 states have (on average 4.175552767759134) internal successors, (53255), 14831 states have internal predecessors, (53255), 0 states have call successors, (0), 0 states 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:32:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14832 states to 14832 states and 53255 transitions. [2022-11-21 16:32:46,985 INFO L78 Accepts]: Start accepts. Automaton has 14832 states and 53255 transitions. Word has length 1 [2022-11-21 16:32:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:32:46,985 INFO L495 AbstractCegarLoop]: Abstraction has 14832 states and 53255 transitions. [2022-11-21 16:32:46,986 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:32:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 14832 states and 53255 transitions. [2022-11-21 16:32:46,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 16:32:46,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:32:46,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 16:32:47,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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)] Forceful destruction successful, exit code 0 [2022-11-21 16:32:47,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:47,202 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:32:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:32:47,203 INFO L85 PathProgramCache]: Analyzing trace with hash 43449513, now seen corresponding path program 1 times [2022-11-21 16:32:47,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:32:47,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738802440] [2022-11-21 16:32:47,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:32:47,204 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:32:47,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:32:47,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:47,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:32:47,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:32:47,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:32:48,054 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:32:48,056 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:32:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:32:48,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:32:48,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:32:48,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738802440] [2022-11-21 16:32:48,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738802440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:32:48,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:32:48,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:32:48,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413426076] [2022-11-21 16:32:48,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:32:48,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:32:48,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:32:48,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:32:48,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:32:48,100 INFO L87 Difference]: Start difference. First operand 14832 states and 53255 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:32:48,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:32:48,659 INFO L93 Difference]: Finished difference Result 7176 states and 24912 transitions. [2022-11-21 16:32:48,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:32:48,660 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:32:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:32:48,707 INFO L225 Difference]: With dead ends: 7176 [2022-11-21 16:32:48,708 INFO L226 Difference]: Without dead ends: 7176 [2022-11-21 16:32:48,708 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:32:48,709 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:32:48,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:32:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7176 states. [2022-11-21 16:32:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7176 to 7176. [2022-11-21 16:32:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7176 states, 6559 states have (on average 3.798139960359811) internal successors, (24912), 7175 states have internal predecessors, (24912), 0 states have call successors, (0), 0 states 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:32:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7176 states to 7176 states and 24912 transitions. [2022-11-21 16:32:49,218 INFO L78 Accepts]: Start accepts. Automaton has 7176 states and 24912 transitions. Word has length 4 [2022-11-21 16:32:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:32:49,219 INFO L495 AbstractCegarLoop]: Abstraction has 7176 states and 24912 transitions. [2022-11-21 16:32:49,219 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:32:49,219 INFO L276 IsEmpty]: Start isEmpty. Operand 7176 states and 24912 transitions. [2022-11-21 16:32:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 16:32:49,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:32:49,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 16:32:49,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:49,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:49,433 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:32:49,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:32:49,435 INFO L85 PathProgramCache]: Analyzing trace with hash 43449514, now seen corresponding path program 1 times [2022-11-21 16:32:49,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:32:49,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078196253] [2022-11-21 16:32:49,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:32:49,436 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:32:49,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:32:49,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:49,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:32:50,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:32:50,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:32:50,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:32:50,116 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:32:50,162 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:32:50,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:32:50,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:32:50,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078196253] [2022-11-21 16:32:50,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078196253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:32:50,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:32:50,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:32:50,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900119348] [2022-11-21 16:32:50,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:32:50,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:32:50,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:32:50,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:32:50,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:32:50,166 INFO L87 Difference]: Start difference. First operand 7176 states and 24912 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:32:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:32:50,458 INFO L93 Difference]: Finished difference Result 2206 states and 7261 transitions. [2022-11-21 16:32:50,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:32:50,459 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:32:50,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:32:50,472 INFO L225 Difference]: With dead ends: 2206 [2022-11-21 16:32:50,472 INFO L226 Difference]: Without dead ends: 2206 [2022-11-21 16:32:50,473 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:32:50,474 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:32:50,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:32:50,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2022-11-21 16:32:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 2206. [2022-11-21 16:32:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2206 states, 2124 states have (on average 3.4185499058380415) internal successors, (7261), 2205 states have internal predecessors, (7261), 0 states have call successors, (0), 0 states 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:32:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 7261 transitions. [2022-11-21 16:32:50,570 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 7261 transitions. Word has length 4 [2022-11-21 16:32:50,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:32:50,570 INFO L495 AbstractCegarLoop]: Abstraction has 2206 states and 7261 transitions. [2022-11-21 16:32:50,571 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:32:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 7261 transitions. [2022-11-21 16:32:50,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:32:50,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:32:50,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:32:50,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:50,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:50,790 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:32:50,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:32:50,790 INFO L85 PathProgramCache]: Analyzing trace with hash -950787386, now seen corresponding path program 1 times [2022-11-21 16:32:50,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:32:50,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705512667] [2022-11-21 16:32:50,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:32:50,793 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:32:50,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:32:50,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:50,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:32:51,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:32:51,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:32:51,454 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:32:51,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:32:51,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:32:51,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705512667] [2022-11-21 16:32:51,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705512667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:32:51,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:32:51,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:32:51,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48860330] [2022-11-21 16:32:51,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:32:51,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:32:51,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:32:51,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:32:51,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:32:51,463 INFO L87 Difference]: Start difference. First operand 2206 states and 7261 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) 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:32:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:32:51,862 INFO L93 Difference]: Finished difference Result 1023 states and 2708 transitions. [2022-11-21 16:32:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:32:51,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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:32:51,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:32:51,869 INFO L225 Difference]: With dead ends: 1023 [2022-11-21 16:32:51,869 INFO L226 Difference]: Without dead ends: 1023 [2022-11-21 16:32:51,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:32:51,876 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 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.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:32:51,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:32:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2022-11-21 16:32:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1023. [2022-11-21 16:32:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 965 states have (on average 2.806217616580311) internal successors, (2708), 1022 states have internal predecessors, (2708), 0 states have call successors, (0), 0 states 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:32:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 2708 transitions. [2022-11-21 16:32:51,917 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 2708 transitions. Word has length 11 [2022-11-21 16:32:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:32:51,918 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 2708 transitions. [2022-11-21 16:32:51,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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:32:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 2708 transitions. [2022-11-21 16:32:51,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:32:51,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:32:51,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:32:51,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:52,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:52,139 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:32:52,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:32:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash -189114237, now seen corresponding path program 1 times [2022-11-21 16:32:52,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:32:52,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953222971] [2022-11-21 16:32:52,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:32:52,141 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:32:52,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:32:52,142 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:52,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:32:52,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:32:52,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:32:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:32:52,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:32:52,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:32:52,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953222971] [2022-11-21 16:32:52,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953222971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:32:52,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:32:52,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:32:52,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125287693] [2022-11-21 16:32:52,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:32:52,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:32:52,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:32:52,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:32:52,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:32:52,789 INFO L87 Difference]: Start difference. First operand 1023 states and 2708 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:32:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:32:53,338 INFO L93 Difference]: Finished difference Result 322 states and 687 transitions. [2022-11-21 16:32:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:32:53,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 16:32:53,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:32:53,340 INFO L225 Difference]: With dead ends: 322 [2022-11-21 16:32:53,341 INFO L226 Difference]: Without dead ends: 322 [2022-11-21 16:32:53,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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:32:53,342 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:32:53,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 11 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:32:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-11-21 16:32:53,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2022-11-21 16:32:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 302 states have (on average 2.274834437086093) internal successors, (687), 321 states have internal predecessors, (687), 0 states have call successors, (0), 0 states 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:32:53,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 687 transitions. [2022-11-21 16:32:53,351 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 687 transitions. Word has length 14 [2022-11-21 16:32:53,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:32:53,351 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 687 transitions. [2022-11-21 16:32:53,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:32:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 687 transitions. [2022-11-21 16:32:53,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 16:32:53,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:32:53,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:32:53,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:53,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:53,567 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:32:53,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:32:53,568 INFO L85 PathProgramCache]: Analyzing trace with hash -458206019, now seen corresponding path program 1 times [2022-11-21 16:32:53,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:32:53,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647127649] [2022-11-21 16:32:53,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:32:53,569 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:32:53,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:32:53,570 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:53,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:32:54,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:32:54,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:32:54,192 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:32:54,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:32:54,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:32:54,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647127649] [2022-11-21 16:32:54,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647127649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:32:54,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:32:54,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:32:54,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142688057] [2022-11-21 16:32:54,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:32:54,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:32:54,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:32:54,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:32:54,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:32:54,195 INFO L87 Difference]: Start difference. First operand 322 states and 687 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:32:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:32:54,903 INFO L93 Difference]: Finished difference Result 183 states and 420 transitions. [2022-11-21 16:32:54,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:32:54,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-21 16:32:54,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:32:54,904 INFO L225 Difference]: With dead ends: 183 [2022-11-21 16:32:54,904 INFO L226 Difference]: Without dead ends: 183 [2022-11-21 16:32:54,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:32:54,906 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:32:54,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 18 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 16:32:54,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-21 16:32:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-21 16:32:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 2.346368715083799) internal successors, (420), 182 states have internal predecessors, (420), 0 states have call successors, (0), 0 states 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:32:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 420 transitions. [2022-11-21 16:32:54,920 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 420 transitions. Word has length 18 [2022-11-21 16:32:54,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:32:54,920 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 420 transitions. [2022-11-21 16:32:54,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:32:54,921 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 420 transitions. [2022-11-21 16:32:54,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:32:54,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:32:54,924 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:32:54,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:55,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:55,138 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:32:55,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:32:55,139 INFO L85 PathProgramCache]: Analyzing trace with hash 643111073, now seen corresponding path program 1 times [2022-11-21 16:32:55,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:32:55,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547108667] [2022-11-21 16:32:55,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:32:55,140 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:32:55,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:32:55,141 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:55,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:32:55,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:32:55,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:32:55,776 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:32:55,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:32:55,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:32:55,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547108667] [2022-11-21 16:32:55,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547108667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:32:55,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:32:55,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:32:55,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729020086] [2022-11-21 16:32:55,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:32:55,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:32:55,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:32:55,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:32:55,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:32:55,779 INFO L87 Difference]: Start difference. First operand 183 states and 420 transitions. Second operand has 3 states, 2 states have (on average 11.0) 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 16:32:56,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:32:56,122 INFO L93 Difference]: Finished difference Result 236 states and 524 transitions. [2022-11-21 16:32:56,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:32:56,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) 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 16:32:56,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:32:56,123 INFO L225 Difference]: With dead ends: 236 [2022-11-21 16:32:56,123 INFO L226 Difference]: Without dead ends: 236 [2022-11-21 16:32:56,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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:32:56,124 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:32:56,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:32:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-21 16:32:56,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 230. [2022-11-21 16:32:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 226 states have (on average 2.3053097345132745) internal successors, (521), 229 states have internal predecessors, (521), 0 states have call successors, (0), 0 states 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:32:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 521 transitions. [2022-11-21 16:32:56,140 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 521 transitions. Word has length 22 [2022-11-21 16:32:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:32:56,140 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 521 transitions. [2022-11-21 16:32:56,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) 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 16:32:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 521 transitions. [2022-11-21 16:32:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:32:56,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:32:56,142 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:32:56,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:56,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:56,355 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:32:56,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:32:56,356 INFO L85 PathProgramCache]: Analyzing trace with hash 643110682, now seen corresponding path program 1 times [2022-11-21 16:32:56,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:32:56,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744544120] [2022-11-21 16:32:56,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:32:56,357 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:32:56,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:32:56,358 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:56,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:32:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:32:56,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 16:32:56,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:06,054 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 3419 treesize of output 3409 [2022-11-21 16:33:06,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3409 treesize of output 3405 [2022-11-21 16:33:06,313 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 3399 treesize of output 3395 [2022-11-21 16:33:06,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3395 treesize of output 3391 [2022-11-21 16:33:06,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3385 treesize of output 3381 [2022-11-21 16:33:06,635 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 3375 treesize of output 3371 [2022-11-21 16:33:06,741 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 3371 treesize of output 3367 [2022-11-21 16:33:07,188 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:33:07,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:33:07,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:33:07,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744544120] [2022-11-21 16:33:07,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744544120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:33:07,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:33:07,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:33:07,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449697040] [2022-11-21 16:33:07,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:33:07,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:33:07,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:33:07,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:33:07,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:33:07,191 INFO L87 Difference]: Start difference. First operand 230 states and 521 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:07,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:07,434 INFO L93 Difference]: Finished difference Result 229 states and 519 transitions. [2022-11-21 16:33:07,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:33:07,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 16:33:07,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:07,435 INFO L225 Difference]: With dead ends: 229 [2022-11-21 16:33:07,435 INFO L226 Difference]: Without dead ends: 229 [2022-11-21 16:33:07,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:33:07,436 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:07,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:33:07,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-21 16:33:07,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-11-21 16:33:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 226 states have (on average 2.2964601769911503) internal successors, (519), 228 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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:33:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 519 transitions. [2022-11-21 16:33:07,442 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 519 transitions. Word has length 22 [2022-11-21 16:33:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:07,443 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 519 transitions. [2022-11-21 16:33:07,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 519 transitions. [2022-11-21 16:33:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:33:07,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:07,444 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:33:07,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:33:07,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:33:07,645 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:33:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash 643110683, now seen corresponding path program 1 times [2022-11-21 16:33:07,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:33:07,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408269044] [2022-11-21 16:33:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:07,646 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:33:07,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:33:07,647 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:33:07,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:33:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:08,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:33:08,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:15,447 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 3869 treesize of output 3861 [2022-11-21 16:33:15,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3861 treesize of output 3857 [2022-11-21 16:33:15,648 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 3851 treesize of output 3847 [2022-11-21 16:33:15,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3847 treesize of output 3843 [2022-11-21 16:33:15,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3837 treesize of output 3833 [2022-11-21 16:33:15,959 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 3827 treesize of output 3823 [2022-11-21 16:33:16,074 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 3823 treesize of output 3819 [2022-11-21 16:33:16,604 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:33:16,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:33:16,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:33:16,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408269044] [2022-11-21 16:33:16,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408269044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:33:16,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:33:16,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:33:16,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200847324] [2022-11-21 16:33:16,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:33:16,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:33:16,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:33:16,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:33:16,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:33:16,607 INFO L87 Difference]: Start difference. First operand 229 states and 519 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:16,835 INFO L93 Difference]: Finished difference Result 228 states and 517 transitions. [2022-11-21 16:33:16,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:33:16,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 16:33:16,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:16,838 INFO L225 Difference]: With dead ends: 228 [2022-11-21 16:33:16,838 INFO L226 Difference]: Without dead ends: 228 [2022-11-21 16:33:16,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:33:16,839 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:16,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:33:16,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-21 16:33:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-11-21 16:33:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 226 states have (on average 2.2876106194690267) internal successors, (517), 227 states have internal predecessors, (517), 0 states have call successors, (0), 0 states 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:33:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 517 transitions. [2022-11-21 16:33:16,847 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 517 transitions. Word has length 22 [2022-11-21 16:33:16,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:16,847 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 517 transitions. [2022-11-21 16:33:16,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 517 transitions. [2022-11-21 16:33:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:33:16,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:16,849 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:33:16,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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 16:33:17,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:33:17,063 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:33:17,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:17,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1648501975, now seen corresponding path program 2 times [2022-11-21 16:33:17,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:33:17,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671790235] [2022-11-21 16:33:17,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:33:17,064 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:33:17,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:33:17,065 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:33:17,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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 16:33:17,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 16:33:17,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:33:17,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 16:33:17,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:38,044 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 5 treesize of output 3 [2022-11-21 16:33:38,079 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 16:33:38,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 45 treesize of output 33 [2022-11-21 16:33:38,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2022-11-21 16:33:38,829 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:33:38,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:33:38,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:33:38,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671790235] [2022-11-21 16:33:38,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671790235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:33:38,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:33:38,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:33:38,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112691487] [2022-11-21 16:33:38,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:33:38,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:33:38,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:33:38,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:33:38,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:33:38,832 INFO L87 Difference]: Start difference. First operand 228 states and 517 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:39,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:39,439 INFO L93 Difference]: Finished difference Result 301 states and 660 transitions. [2022-11-21 16:33:39,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:33:39,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 16:33:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:39,440 INFO L225 Difference]: With dead ends: 301 [2022-11-21 16:33:39,441 INFO L226 Difference]: Without dead ends: 301 [2022-11-21 16:33:39,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:33:39,442 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 27 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:39,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 4 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:33:39,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-11-21 16:33:39,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 224. [2022-11-21 16:33:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 222 states have (on average 2.2927927927927927) internal successors, (509), 223 states have internal predecessors, (509), 0 states have call successors, (0), 0 states 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:33:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 509 transitions. [2022-11-21 16:33:39,450 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 509 transitions. Word has length 22 [2022-11-21 16:33:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:39,450 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 509 transitions. [2022-11-21 16:33:39,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 509 transitions. [2022-11-21 16:33:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:33:39,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:39,452 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:33:39,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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)] Forceful destruction successful, exit code 0 [2022-11-21 16:33:39,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:33:39,666 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:33:39,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:39,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1308916655, now seen corresponding path program 3 times [2022-11-21 16:33:39,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:33:39,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913711614] [2022-11-21 16:33:39,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:33:39,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:33:39,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:33:39,669 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:33:39,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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 16:33:40,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-21 16:33:40,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:33:40,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-21 16:33:40,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:50,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 944 treesize of output 940 [2022-11-21 16:33:50,203 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 934 treesize of output 930 [2022-11-21 16:33:50,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2022-11-21 16:33:50,445 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 5 treesize of output 3 [2022-11-21 16:33:50,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 45 treesize of output 33 [2022-11-21 16:33:51,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2022-11-21 16:33:51,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2022-11-21 16:33:51,423 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:33:51,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:33:51,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:33:51,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913711614] [2022-11-21 16:33:51,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913711614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:33:51,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:33:51,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:33:51,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025349822] [2022-11-21 16:33:51,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:33:51,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:33:51,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:33:51,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:33:51,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:33:51,426 INFO L87 Difference]: Start difference. First operand 224 states and 509 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:52,054 INFO L93 Difference]: Finished difference Result 293 states and 644 transitions. [2022-11-21 16:33:52,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:33:52,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 16:33:52,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:52,056 INFO L225 Difference]: With dead ends: 293 [2022-11-21 16:33:52,056 INFO L226 Difference]: Without dead ends: 293 [2022-11-21 16:33:52,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:33:52,057 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:52,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 4 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:33:52,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-21 16:33:52,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 222. [2022-11-21 16:33:52,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 220 states have (on average 2.290909090909091) internal successors, (504), 221 states have internal predecessors, (504), 0 states have call successors, (0), 0 states 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:33:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 504 transitions. [2022-11-21 16:33:52,065 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 504 transitions. Word has length 22 [2022-11-21 16:33:52,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:52,066 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 504 transitions. [2022-11-21 16:33:52,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 504 transitions. [2022-11-21 16:33:52,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:33:52,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:52,067 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:33:52,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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 16:33:52,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:33:52,271 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:33:52,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:52,271 INFO L85 PathProgramCache]: Analyzing trace with hash 207087063, now seen corresponding path program 4 times [2022-11-21 16:33:52,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:33:52,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996719983] [2022-11-21 16:33:52,272 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 16:33:52,272 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:33:52,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:33:52,273 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:33:52,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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 16:33:52,875 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 16:33:52,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:33:52,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-21 16:33:52,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:38:49,297 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 5 treesize of output 3 [2022-11-21 16:38:49,320 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 16:38:49,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 49 treesize of output 33 [2022-11-21 16:38:50,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2022-11-21 16:38:50,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2022-11-21 16:38:50,473 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:38:50,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:38:50,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:38:50,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996719983] [2022-11-21 16:38:50,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996719983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:38:50,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:38:50,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:38:50,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057427442] [2022-11-21 16:38:50,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:38:50,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:38:50,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:38:50,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:38:50,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:38:50,475 INFO L87 Difference]: Start difference. First operand 222 states and 504 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:38:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:38:51,177 INFO L93 Difference]: Finished difference Result 291 states and 639 transitions. [2022-11-21 16:38:51,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:38:51,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 16:38:51,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:38:51,179 INFO L225 Difference]: With dead ends: 291 [2022-11-21 16:38:51,179 INFO L226 Difference]: Without dead ends: 291 [2022-11-21 16:38:51,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:38:51,181 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:38:51,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:38:51,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-11-21 16:38:51,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 219. [2022-11-21 16:38:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 217 states have (on average 2.2857142857142856) internal successors, (496), 218 states have internal predecessors, (496), 0 states have call successors, (0), 0 states 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:38:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 496 transitions. [2022-11-21 16:38:51,190 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 496 transitions. Word has length 22 [2022-11-21 16:38:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:38:51,190 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 496 transitions. [2022-11-21 16:38:51,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:38:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 496 transitions. [2022-11-21 16:38:51,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:38:51,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:38:51,192 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:38:51,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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 16:38:51,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:38:51,407 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-21 16:38:51,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:38:51,407 INFO L85 PathProgramCache]: Analyzing trace with hash -427069711, now seen corresponding path program 5 times [2022-11-21 16:38:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:38:51,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834632800] [2022-11-21 16:38:51,408 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 16:38:51,408 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:38:51,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:38:51,409 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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:38:51,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab93050f-362b-4892-a1ad-749415b96d87/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 (14)] Waiting until timeout for monitored process [2022-11-21 16:38:52,192 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 16:38:52,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:38:52,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-21 16:38:52,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:38:52,255 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:38:52,256 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:38:52,375 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:38:52,375 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:38:52,475 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:38:52,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-21 16:38:52,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:38:52,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 16