./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 932dbff5eab91f48afae7fbaa75574114ec0af0a04ac9352bdcfc8911a65e56a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 19:59:23,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 19:59:23,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 19:59:23,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 19:59:23,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 19:59:23,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 19:59:23,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 19:59:23,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 19:59:23,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 19:59:23,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 19:59:23,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 19:59:23,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 19:59:23,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 19:59:23,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 19:59:23,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 19:59:23,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 19:59:23,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 19:59:23,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 19:59:23,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 19:59:23,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 19:59:23,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 19:59:23,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 19:59:23,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 19:59:23,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 19:59:23,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 19:59:23,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 19:59:23,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 19:59:23,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 19:59:23,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 19:59:23,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 19:59:23,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 19:59:23,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 19:59:23,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 19:59:23,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 19:59:23,184 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 19:59:23,184 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 19:59:23,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 19:59:23,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 19:59:23,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 19:59:23,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 19:59:23,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 19:59:23,188 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-16 19:59:23,244 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 19:59:23,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 19:59:23,245 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 19:59:23,245 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 19:59:23,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 19:59:23,246 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 19:59:23,246 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 19:59:23,246 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 19:59:23,247 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 19:59:23,247 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 19:59:23,248 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 19:59:23,248 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 19:59:23,248 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 19:59:23,249 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 19:59:23,249 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 19:59:23,249 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 19:59:23,249 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 19:59:23,249 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 19:59:23,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 19:59:23,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 19:59:23,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 19:59:23,252 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 19:59:23,253 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 19:59:23,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 19:59:23,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 19:59:23,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 19:59:23,253 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 19:59:23,254 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 19:59:23,254 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 19:59:23,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 19:59:23,254 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 19:59:23,255 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 19:59:23,255 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 19:59:23,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 19:59:23,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 19:59:23,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:59:23,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 19:59:23,256 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 19:59:23,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 19:59:23,256 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 19:59:23,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 19:59:23,257 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 19:59:23,257 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_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/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_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0 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 -> Taipan 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 -> 932dbff5eab91f48afae7fbaa75574114ec0af0a04ac9352bdcfc8911a65e56a [2022-11-16 19:59:23,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 19:59:23,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 19:59:23,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 19:59:23,625 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 19:59:23,626 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 19:59:23,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 19:59:23,708 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/data/730830f3e/002137e81e4a43e8871459f513f3060d/FLAGa00a867f7 [2022-11-16 19:59:24,397 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 19:59:24,398 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 19:59:24,417 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/data/730830f3e/002137e81e4a43e8871459f513f3060d/FLAGa00a867f7 [2022-11-16 19:59:24,615 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/data/730830f3e/002137e81e4a43e8871459f513f3060d [2022-11-16 19:59:24,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 19:59:24,619 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 19:59:24,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 19:59:24,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 19:59:24,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 19:59:24,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:59:24" (1/1) ... [2022-11-16 19:59:24,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed183f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:24, skipping insertion in model container [2022-11-16 19:59:24,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:59:24" (1/1) ... [2022-11-16 19:59:24,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 19:59:24,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 19:59:24,909 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-16 19:59:25,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:59:25,141 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 19:59:25,159 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-16 19:59:25,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:59:25,249 INFO L208 MainTranslator]: Completed translation [2022-11-16 19:59:25,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:25 WrapperNode [2022-11-16 19:59:25,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 19:59:25,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 19:59:25,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 19:59:25,251 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 19:59:25,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:25" (1/1) ... [2022-11-16 19:59:25,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:25" (1/1) ... [2022-11-16 19:59:25,337 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-11-16 19:59:25,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 19:59:25,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 19:59:25,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 19:59:25,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 19:59:25,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:25" (1/1) ... [2022-11-16 19:59:25,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:25" (1/1) ... [2022-11-16 19:59:25,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:25" (1/1) ... [2022-11-16 19:59:25,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:25" (1/1) ... [2022-11-16 19:59:25,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:25" (1/1) ... [2022-11-16 19:59:25,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:25" (1/1) ... [2022-11-16 19:59:25,366 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:25" (1/1) ... [2022-11-16 19:59:25,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:25" (1/1) ... [2022-11-16 19:59:25,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 19:59:25,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 19:59:25,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 19:59:25,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 19:59:25,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:25" (1/1) ... [2022-11-16 19:59:25,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:59:25,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:59:25,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 19:59:25,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 19:59:25,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 19:59:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 19:59:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 19:59:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 19:59:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 19:59:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 19:59:25,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 19:59:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 19:59:25,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 19:59:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 19:59:25,491 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 19:59:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 19:59:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 19:59:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 19:59:25,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 19:59:25,493 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 19:59:25,681 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 19:59:25,692 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 19:59:26,193 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 19:59:26,376 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 19:59:26,377 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 19:59:26,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:59:26 BoogieIcfgContainer [2022-11-16 19:59:26,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 19:59:26,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 19:59:26,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 19:59:26,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 19:59:26,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:59:24" (1/3) ... [2022-11-16 19:59:26,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c60d2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:59:26, skipping insertion in model container [2022-11-16 19:59:26,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:25" (2/3) ... [2022-11-16 19:59:26,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c60d2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:59:26, skipping insertion in model container [2022-11-16 19:59:26,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:59:26" (3/3) ... [2022-11-16 19:59:26,390 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 19:59:26,410 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 19:59:26,410 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-16 19:59:26,410 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 19:59:26,472 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 19:59:26,509 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 19:59:26,526 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 129 transitions, 273 flow [2022-11-16 19:59:26,529 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 129 transitions, 273 flow [2022-11-16 19:59:26,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 129 transitions, 273 flow [2022-11-16 19:59:26,596 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-11-16 19:59:26,597 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 19:59:26,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-16 19:59:26,606 INFO L119 LiptonReduction]: Number of co-enabled transitions 2544 [2022-11-16 19:59:32,437 INFO L134 LiptonReduction]: Checked pairs total: 7336 [2022-11-16 19:59:32,438 INFO L136 LiptonReduction]: Total number of compositions: 126 [2022-11-16 19:59:32,452 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 37 transitions, 89 flow [2022-11-16 19:59:32,581 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1540 states, 1525 states have (on average 3.4072131147540983) internal successors, (5196), 1539 states have internal predecessors, (5196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:32,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 19:59:32,616 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;@19241706, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 19:59:32,617 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-16 19:59:32,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 1540 states, 1525 states have (on average 3.4072131147540983) internal successors, (5196), 1539 states have internal predecessors, (5196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 19:59:32,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:59:32,630 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 19:59:32,631 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 19:59:32,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:59:32,640 INFO L85 PathProgramCache]: Analyzing trace with hash 553, now seen corresponding path program 1 times [2022-11-16 19:59:32,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:59:32,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942654115] [2022-11-16 19:59:32,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:59:32,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:59:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:59:32,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-16 19:59:32,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:59:32,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942654115] [2022-11-16 19:59:32,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942654115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:59:32,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:59:32,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 19:59:32,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143668347] [2022-11-16 19:59:32,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:59:32,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 19:59:32,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:59:32,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 19:59:32,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 19:59:32,844 INFO L87 Difference]: Start difference. First operand has 1540 states, 1525 states have (on average 3.4072131147540983) internal successors, (5196), 1539 states have internal predecessors, (5196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:59:32,997 INFO L93 Difference]: Finished difference Result 1454 states and 4764 transitions. [2022-11-16 19:59:32,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 19:59:33,000 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-16 19:59:33,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:59:33,030 INFO L225 Difference]: With dead ends: 1454 [2022-11-16 19:59:33,030 INFO L226 Difference]: Without dead ends: 1454 [2022-11-16 19:59:33,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 19:59:33,034 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:59:33,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:59:33,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2022-11-16 19:59:33,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1454. [2022-11-16 19:59:33,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1449 states have (on average 3.287784679089027) internal successors, (4764), 1453 states have internal predecessors, (4764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 4764 transitions. [2022-11-16 19:59:33,154 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 4764 transitions. Word has length 1 [2022-11-16 19:59:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:59:33,155 INFO L495 AbstractCegarLoop]: Abstraction has 1454 states and 4764 transitions. [2022-11-16 19:59:33,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:33,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 4764 transitions. [2022-11-16 19:59:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 19:59:33,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:59:33,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 19:59:33,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 19:59:33,156 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 19:59:33,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:59:33,157 INFO L85 PathProgramCache]: Analyzing trace with hash 546071, now seen corresponding path program 1 times [2022-11-16 19:59:33,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:59:33,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146412664] [2022-11-16 19:59:33,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:59:33,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:59:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:59:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:59:33,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:59:33,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146412664] [2022-11-16 19:59:33,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146412664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:59:33,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:59:33,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 19:59:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003797582] [2022-11-16 19:59:33,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:59:33,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:59:33,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:59:33,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:59:33,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:59:33,514 INFO L87 Difference]: Start difference. First operand 1454 states and 4764 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:59:33,614 INFO L93 Difference]: Finished difference Result 1188 states and 3838 transitions. [2022-11-16 19:59:33,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:59:33,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-16 19:59:33,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:59:33,623 INFO L225 Difference]: With dead ends: 1188 [2022-11-16 19:59:33,623 INFO L226 Difference]: Without dead ends: 1152 [2022-11-16 19:59:33,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:59:33,625 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:59:33,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 8 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:59:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2022-11-16 19:59:33,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2022-11-16 19:59:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1150 states have (on average 3.253913043478261) internal successors, (3742), 1151 states have internal predecessors, (3742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:33,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 3742 transitions. [2022-11-16 19:59:33,667 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 3742 transitions. Word has length 3 [2022-11-16 19:59:33,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:59:33,668 INFO L495 AbstractCegarLoop]: Abstraction has 1152 states and 3742 transitions. [2022-11-16 19:59:33,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:33,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 3742 transitions. [2022-11-16 19:59:33,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 19:59:33,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:59:33,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:59:33,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 19:59:33,671 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 19:59:33,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:59:33,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1529481830, now seen corresponding path program 1 times [2022-11-16 19:59:33,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:59:33,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300756575] [2022-11-16 19:59:33,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:59:33,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:59:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:59:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:59:33,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:59:33,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300756575] [2022-11-16 19:59:33,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300756575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:59:33,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:59:33,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 19:59:33,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916914182] [2022-11-16 19:59:33,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:59:33,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 19:59:33,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:59:33,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 19:59:33,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 19:59:33,962 INFO L87 Difference]: Start difference. First operand 1152 states and 3742 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:34,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:59:34,251 INFO L93 Difference]: Finished difference Result 2328 states and 7280 transitions. [2022-11-16 19:59:34,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:59:34,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 19:59:34,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:59:34,268 INFO L225 Difference]: With dead ends: 2328 [2022-11-16 19:59:34,268 INFO L226 Difference]: Without dead ends: 2328 [2022-11-16 19:59:34,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:59:34,273 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:59:34,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 15 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:59:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2022-11-16 19:59:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 1648. [2022-11-16 19:59:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1646 states have (on average 3.267314702308627) internal successors, (5378), 1647 states have internal predecessors, (5378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:34,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 5378 transitions. [2022-11-16 19:59:34,359 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 5378 transitions. Word has length 10 [2022-11-16 19:59:34,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:59:34,360 INFO L495 AbstractCegarLoop]: Abstraction has 1648 states and 5378 transitions. [2022-11-16 19:59:34,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:34,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 5378 transitions. [2022-11-16 19:59:34,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 19:59:34,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:59:34,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:59:34,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 19:59:34,363 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 19:59:34,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:59:34,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1529481868, now seen corresponding path program 1 times [2022-11-16 19:59:34,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:59:34,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685184983] [2022-11-16 19:59:34,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:59:34,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:59:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:59:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:59:34,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:59:34,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685184983] [2022-11-16 19:59:34,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685184983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:59:34,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:59:34,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:59:34,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739314601] [2022-11-16 19:59:34,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:59:34,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:59:34,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:59:34,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:59:34,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:59:34,790 INFO L87 Difference]: Start difference. First operand 1648 states and 5378 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:34,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:59:34,935 INFO L93 Difference]: Finished difference Result 1468 states and 4584 transitions. [2022-11-16 19:59:34,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:59:34,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 19:59:34,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:59:34,946 INFO L225 Difference]: With dead ends: 1468 [2022-11-16 19:59:34,946 INFO L226 Difference]: Without dead ends: 1207 [2022-11-16 19:59:34,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:59:34,950 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:59:34,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 24 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:59:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2022-11-16 19:59:34,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1207. [2022-11-16 19:59:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1206 states have (on average 3.138474295190713) internal successors, (3785), 1206 states have internal predecessors, (3785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 3785 transitions. [2022-11-16 19:59:35,013 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 3785 transitions. Word has length 10 [2022-11-16 19:59:35,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:59:35,015 INFO L495 AbstractCegarLoop]: Abstraction has 1207 states and 3785 transitions. [2022-11-16 19:59:35,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 3785 transitions. [2022-11-16 19:59:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 19:59:35,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:59:35,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:59:35,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 19:59:35,024 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 19:59:35,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:59:35,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1461994736, now seen corresponding path program 1 times [2022-11-16 19:59:35,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:59:35,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104124487] [2022-11-16 19:59:35,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:59:35,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:59:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:59:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:59:35,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:59:35,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104124487] [2022-11-16 19:59:35,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104124487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:59:35,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:59:35,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:59:35,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488111995] [2022-11-16 19:59:35,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:59:35,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:59:35,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:59:35,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:59:35,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:59:35,280 INFO L87 Difference]: Start difference. First operand 1207 states and 3785 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:59:35,503 INFO L93 Difference]: Finished difference Result 1461 states and 4369 transitions. [2022-11-16 19:59:35,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 19:59:35,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 19:59:35,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:59:35,511 INFO L225 Difference]: With dead ends: 1461 [2022-11-16 19:59:35,511 INFO L226 Difference]: Without dead ends: 1251 [2022-11-16 19:59:35,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:59:35,513 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 56 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:59:35,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 14 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:59:35,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2022-11-16 19:59:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 987. [2022-11-16 19:59:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 986 states have (on average 3.112576064908722) internal successors, (3069), 986 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 3069 transitions. [2022-11-16 19:59:35,552 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 3069 transitions. Word has length 11 [2022-11-16 19:59:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:59:35,553 INFO L495 AbstractCegarLoop]: Abstraction has 987 states and 3069 transitions. [2022-11-16 19:59:35,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 3069 transitions. [2022-11-16 19:59:35,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 19:59:35,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:59:35,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:59:35,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 19:59:35,556 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 19:59:35,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:59:35,556 INFO L85 PathProgramCache]: Analyzing trace with hash 952523278, now seen corresponding path program 1 times [2022-11-16 19:59:35,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:59:35,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538605037] [2022-11-16 19:59:35,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:59:35,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:59:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:59:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:59:35,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:59:35,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538605037] [2022-11-16 19:59:35,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538605037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:59:35,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:59:35,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 19:59:35,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527499466] [2022-11-16 19:59:35,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:59:35,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 19:59:35,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:59:35,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 19:59:35,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 19:59:35,697 INFO L87 Difference]: Start difference. First operand 987 states and 3069 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-16 19:59:35,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:59:35,845 INFO L93 Difference]: Finished difference Result 1027 states and 3111 transitions. [2022-11-16 19:59:35,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:59:35,851 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-16 19:59:35,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:59:35,857 INFO L225 Difference]: With dead ends: 1027 [2022-11-16 19:59:35,857 INFO L226 Difference]: Without dead ends: 907 [2022-11-16 19:59:35,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:59:35,860 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 28 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:59:35,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 16 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:59:35,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-11-16 19:59:35,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 835. [2022-11-16 19:59:35,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 834 states have (on average 3.0731414868105515) internal successors, (2563), 834 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 2563 transitions. [2022-11-16 19:59:35,897 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 2563 transitions. Word has length 12 [2022-11-16 19:59:35,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:59:35,898 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 2563 transitions. [2022-11-16 19:59:35,898 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-16 19:59:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 2563 transitions. [2022-11-16 19:59:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 19:59:35,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:59:35,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:59:35,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 19:59:35,901 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 19:59:35,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:59:35,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1595426327, now seen corresponding path program 1 times [2022-11-16 19:59:35,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:59:35,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26684381] [2022-11-16 19:59:35,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:59:35,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:59:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:59:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:59:36,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:59:36,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26684381] [2022-11-16 19:59:36,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26684381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:59:36,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:59:36,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:59:36,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308147751] [2022-11-16 19:59:36,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:59:36,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 19:59:36,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:59:36,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 19:59:36,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 19:59:36,111 INFO L87 Difference]: Start difference. First operand 835 states and 2563 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-16 19:59:36,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:59:36,245 INFO L93 Difference]: Finished difference Result 744 states and 1998 transitions. [2022-11-16 19:59:36,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:59:36,246 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-16 19:59:36,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:59:36,248 INFO L225 Difference]: With dead ends: 744 [2022-11-16 19:59:36,248 INFO L226 Difference]: Without dead ends: 543 [2022-11-16 19:59:36,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:59:36,250 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:59:36,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 20 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:59:36,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-11-16 19:59:36,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2022-11-16 19:59:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 2.588560885608856) internal successors, (1403), 542 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1403 transitions. [2022-11-16 19:59:36,267 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1403 transitions. Word has length 14 [2022-11-16 19:59:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:59:36,268 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 1403 transitions. [2022-11-16 19:59:36,268 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-16 19:59:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1403 transitions. [2022-11-16 19:59:36,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 19:59:36,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:59:36,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:59:36,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 19:59:36,273 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 19:59:36,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:59:36,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1046048494, now seen corresponding path program 1 times [2022-11-16 19:59:36,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:59:36,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547472472] [2022-11-16 19:59:36,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:59:36,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:59:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:59:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:59:36,494 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:59:36,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547472472] [2022-11-16 19:59:36,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547472472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:59:36,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:59:36,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:59:36,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045286811] [2022-11-16 19:59:36,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:59:36,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:59:36,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:59:36,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:59:36,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:59:36,496 INFO L87 Difference]: Start difference. First operand 543 states and 1403 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:59:36,667 INFO L93 Difference]: Finished difference Result 420 states and 1002 transitions. [2022-11-16 19:59:36,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:59:36,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-16 19:59:36,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:59:36,669 INFO L225 Difference]: With dead ends: 420 [2022-11-16 19:59:36,669 INFO L226 Difference]: Without dead ends: 329 [2022-11-16 19:59:36,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:59:36,670 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 65 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:59:36,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 27 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:59:36,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-11-16 19:59:36,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2022-11-16 19:59:36,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 2.3415384615384616) internal successors, (761), 325 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 761 transitions. [2022-11-16 19:59:36,692 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 761 transitions. Word has length 17 [2022-11-16 19:59:36,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:59:36,692 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 761 transitions. [2022-11-16 19:59:36,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 761 transitions. [2022-11-16 19:59:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 19:59:36,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:59:36,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:59:36,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 19:59:36,695 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 19:59:36,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:59:36,695 INFO L85 PathProgramCache]: Analyzing trace with hash -405778886, now seen corresponding path program 1 times [2022-11-16 19:59:36,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:59:36,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533346996] [2022-11-16 19:59:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:59:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:59:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:59:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:59:37,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:59:37,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533346996] [2022-11-16 19:59:37,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533346996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:59:37,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:59:37,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 19:59:37,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632266308] [2022-11-16 19:59:37,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:59:37,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 19:59:37,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:59:37,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 19:59:37,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:59:37,084 INFO L87 Difference]: Start difference. First operand 326 states and 761 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:37,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:59:37,234 INFO L93 Difference]: Finished difference Result 291 states and 690 transitions. [2022-11-16 19:59:37,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 19:59:37,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 19:59:37,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:59:37,236 INFO L225 Difference]: With dead ends: 291 [2022-11-16 19:59:37,236 INFO L226 Difference]: Without dead ends: 256 [2022-11-16 19:59:37,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:59:37,237 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 86 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:59:37,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 21 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:59:37,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-16 19:59:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2022-11-16 19:59:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 2.413502109704641) internal successors, (572), 237 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:37,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 572 transitions. [2022-11-16 19:59:37,244 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 572 transitions. Word has length 20 [2022-11-16 19:59:37,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:59:37,245 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 572 transitions. [2022-11-16 19:59:37,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 572 transitions. [2022-11-16 19:59:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 19:59:37,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:59:37,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:59:37,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 19:59:37,247 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 19:59:37,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:59:37,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1970273679, now seen corresponding path program 1 times [2022-11-16 19:59:37,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:59:37,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048019583] [2022-11-16 19:59:37,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:59:37,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:59:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:59:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:59:39,342 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:59:39,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048019583] [2022-11-16 19:59:39,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048019583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:59:39,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:59:39,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 19:59:39,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725456363] [2022-11-16 19:59:39,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:59:39,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 19:59:39,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:59:39,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 19:59:39,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:59:39,344 INFO L87 Difference]: Start difference. First operand 238 states and 572 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:59:39,737 INFO L93 Difference]: Finished difference Result 366 states and 835 transitions. [2022-11-16 19:59:39,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:59:39,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-16 19:59:39,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:59:39,740 INFO L225 Difference]: With dead ends: 366 [2022-11-16 19:59:39,740 INFO L226 Difference]: Without dead ends: 263 [2022-11-16 19:59:39,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-16 19:59:39,741 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:59:39,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 66 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 19:59:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-16 19:59:39,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 214. [2022-11-16 19:59:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.2629107981220655) internal successors, (482), 213 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 482 transitions. [2022-11-16 19:59:39,750 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 482 transitions. Word has length 24 [2022-11-16 19:59:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:59:39,750 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 482 transitions. [2022-11-16 19:59:39,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 482 transitions. [2022-11-16 19:59:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 19:59:39,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:59:39,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:59:39,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 19:59:39,752 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 19:59:39,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:59:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash 353608655, now seen corresponding path program 2 times [2022-11-16 19:59:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:59:39,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175765034] [2022-11-16 19:59:39,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:59:39,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:59:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 19:59:39,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 19:59:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 19:59:39,902 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-16 19:59:39,902 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 19:59:39,903 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-16 19:59:39,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-16 19:59:39,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-16 19:59:39,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-16 19:59:39,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-16 19:59:39,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-16 19:59:39,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-16 19:59:39,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-16 19:59:39,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-16 19:59:39,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-16 19:59:39,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-16 19:59:39,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-16 19:59:39,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-16 19:59:39,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 19:59:39,911 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:59:39,917 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 19:59:39,917 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 19:59:40,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:59:40 BasicIcfg [2022-11-16 19:59:40,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 19:59:40,054 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 19:59:40,055 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 19:59:40,055 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 19:59:40,055 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:59:26" (3/4) ... [2022-11-16 19:59:40,058 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 19:59:40,059 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 19:59:40,059 INFO L158 Benchmark]: Toolchain (without parser) took 15440.25ms. Allocated memory was 109.1MB in the beginning and 232.8MB in the end (delta: 123.7MB). Free memory was 63.7MB in the beginning and 146.3MB in the end (delta: -82.6MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2022-11-16 19:59:40,060 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 19:59:40,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 629.46ms. Allocated memory is still 109.1MB. Free memory was 63.5MB in the beginning and 70.4MB in the end (delta: -6.9MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2022-11-16 19:59:40,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.28ms. Allocated memory is still 109.1MB. Free memory was 70.4MB in the beginning and 67.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 19:59:40,061 INFO L158 Benchmark]: Boogie Preprocessor took 33.38ms. Allocated memory is still 109.1MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 19:59:40,061 INFO L158 Benchmark]: RCFGBuilder took 1008.07ms. Allocated memory was 109.1MB in the beginning and 153.1MB in the end (delta: 44.0MB). Free memory was 65.8MB in the beginning and 115.6MB in the end (delta: -49.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-16 19:59:40,062 INFO L158 Benchmark]: TraceAbstraction took 13671.73ms. Allocated memory was 153.1MB in the beginning and 232.8MB in the end (delta: 79.7MB). Free memory was 115.1MB in the beginning and 146.3MB in the end (delta: -31.2MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2022-11-16 19:59:40,063 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 232.8MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 19:59:40,066 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.30ms. Allocated memory is still 109.1MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 629.46ms. Allocated memory is still 109.1MB. Free memory was 63.5MB in the beginning and 70.4MB in the end (delta: -6.9MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.28ms. Allocated memory is still 109.1MB. Free memory was 70.4MB in the beginning and 67.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.38ms. Allocated memory is still 109.1MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1008.07ms. Allocated memory was 109.1MB in the beginning and 153.1MB in the end (delta: 44.0MB). Free memory was 65.8MB in the beginning and 115.6MB in the end (delta: -49.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13671.73ms. Allocated memory was 153.1MB in the beginning and 232.8MB in the end (delta: 79.7MB). Free memory was 115.1MB in the beginning and 146.3MB in the end (delta: -31.2MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 232.8MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 137 PlacesBefore, 46 PlacesAfterwards, 129 TransitionsBefore, 37 TransitionsAfterwards, 2544 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 126 TotalNumberOfCompositions, 7336 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3962, independent: 3762, independent conditional: 0, independent unconditional: 3762, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1860, independent: 1808, independent conditional: 0, independent unconditional: 1808, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1860, independent: 1780, independent conditional: 0, independent unconditional: 1780, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 476, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 437, dependent conditional: 0, dependent unconditional: 437, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3962, independent: 1954, independent conditional: 0, independent unconditional: 1954, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 1860, unknown conditional: 0, unknown unconditional: 1860] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 237, Positive conditional cache size: 0, Positive unconditional cache size: 237, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L717] 0 int __unbuffered_p2_EBX = 0; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool weak$$choice0; [L740] 0 int z$w_buff1; [L743] 0 _Bool weak$$choice2; [L726] 0 _Bool z$flush_delayed; [L738] 0 int z$w_buff0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L711] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd3; [L727] 0 int z$mem_tmp; [L736] 0 _Bool z$read_delayed; [L715] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int *z$read_delayed_var; [L741] 0 _Bool z$w_buff1_used; [L709] 0 int __unbuffered_cnt = 0; [L719] 0 _Bool main$tmp_guard1; [L718] 0 _Bool main$tmp_guard0; [L713] 0 int __unbuffered_p1_EBX = 0; [L739] 0 _Bool z$w_buff0_used; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L843] 0 pthread_t t153; [L844] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t153, ((void *)0), P0, ((void *)0))=-2, t153={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t154; [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L846] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t154, ((void *)0), P1, ((void *)0))=-1, t153={5:0}, t154={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t155; [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L786] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L787] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L789] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L848] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t155, ((void *)0), P2, ((void *)0))=0, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 z$flush_delayed = weak$$choice2 [L808] 3 z$mem_tmp = z [L809] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L810] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L811] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L812] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L813] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L815] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = z [L817] 3 z = z$flush_delayed ? z$mem_tmp : z [L818] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 158 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 393 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 215 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 984 IncrementalHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 76 mSDtfsCounter, 984 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1648occurred in iteration=3, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 1086 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 1404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 19:59:40,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 932dbff5eab91f48afae7fbaa75574114ec0af0a04ac9352bdcfc8911a65e56a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 19:59:42,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 19:59:42,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 19:59:42,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 19:59:42,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 19:59:42,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 19:59:42,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 19:59:42,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 19:59:42,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 19:59:42,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 19:59:42,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 19:59:42,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 19:59:42,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 19:59:42,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 19:59:42,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 19:59:42,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 19:59:42,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 19:59:42,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 19:59:42,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 19:59:42,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 19:59:42,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 19:59:42,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 19:59:42,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 19:59:42,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 19:59:42,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 19:59:42,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 19:59:42,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 19:59:42,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 19:59:42,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 19:59:42,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 19:59:42,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 19:59:42,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 19:59:42,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 19:59:42,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 19:59:42,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 19:59:42,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 19:59:42,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 19:59:42,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 19:59:42,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 19:59:42,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 19:59:42,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 19:59:42,699 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-16 19:59:42,761 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 19:59:42,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 19:59:42,764 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 19:59:42,764 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 19:59:42,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 19:59:42,766 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 19:59:42,766 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 19:59:42,766 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 19:59:42,767 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 19:59:42,767 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 19:59:42,768 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 19:59:42,769 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 19:59:42,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 19:59:42,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 19:59:42,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 19:59:42,772 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 19:59:42,772 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 19:59:42,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 19:59:42,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 19:59:42,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 19:59:42,773 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 19:59:42,774 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 19:59:42,774 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 19:59:42,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 19:59:42,775 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 19:59:42,775 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 19:59:42,775 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 19:59:42,776 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 19:59:42,776 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 19:59:42,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 19:59:42,777 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 19:59:42,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 19:59:42,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:59:42,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 19:59:42,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 19:59:42,779 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-16 19:59:42,779 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 19:59:42,779 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 19:59:42,780 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 19:59:42,780 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_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/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_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0 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 -> Taipan 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 -> 932dbff5eab91f48afae7fbaa75574114ec0af0a04ac9352bdcfc8911a65e56a [2022-11-16 19:59:43,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 19:59:43,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 19:59:43,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 19:59:43,297 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 19:59:43,298 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 19:59:43,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 19:59:43,372 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/data/ae2da5cbc/f3db64d07ef540fe977911606bc6c6d1/FLAG24c27c51c [2022-11-16 19:59:43,971 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 19:59:43,972 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 19:59:43,988 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/data/ae2da5cbc/f3db64d07ef540fe977911606bc6c6d1/FLAG24c27c51c [2022-11-16 19:59:44,266 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/data/ae2da5cbc/f3db64d07ef540fe977911606bc6c6d1 [2022-11-16 19:59:44,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 19:59:44,270 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 19:59:44,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 19:59:44,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 19:59:44,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 19:59:44,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:59:44" (1/1) ... [2022-11-16 19:59:44,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@434a62f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:44, skipping insertion in model container [2022-11-16 19:59:44,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:59:44" (1/1) ... [2022-11-16 19:59:44,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 19:59:44,332 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 19:59:44,570 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-16 19:59:44,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:59:44,937 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 19:59:44,958 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-16 19:59:45,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:59:45,076 INFO L208 MainTranslator]: Completed translation [2022-11-16 19:59:45,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:45 WrapperNode [2022-11-16 19:59:45,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 19:59:45,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 19:59:45,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 19:59:45,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 19:59:45,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:45" (1/1) ... [2022-11-16 19:59:45,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:45" (1/1) ... [2022-11-16 19:59:45,160 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-11-16 19:59:45,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 19:59:45,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 19:59:45,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 19:59:45,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 19:59:45,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:45" (1/1) ... [2022-11-16 19:59:45,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:45" (1/1) ... [2022-11-16 19:59:45,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:45" (1/1) ... [2022-11-16 19:59:45,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:45" (1/1) ... [2022-11-16 19:59:45,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:45" (1/1) ... [2022-11-16 19:59:45,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:45" (1/1) ... [2022-11-16 19:59:45,218 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:45" (1/1) ... [2022-11-16 19:59:45,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:45" (1/1) ... [2022-11-16 19:59:45,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 19:59:45,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 19:59:45,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 19:59:45,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 19:59:45,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:45" (1/1) ... [2022-11-16 19:59:45,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:59:45,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:59:45,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 19:59:45,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 19:59:45,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 19:59:45,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 19:59:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 19:59:45,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 19:59:45,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 19:59:45,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 19:59:45,348 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 19:59:45,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 19:59:45,348 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 19:59:45,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 19:59:45,349 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 19:59:45,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 19:59:45,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 19:59:45,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 19:59:45,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 19:59:45,352 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 19:59:45,626 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 19:59:45,629 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 19:59:46,211 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 19:59:46,362 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 19:59:46,362 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 19:59:46,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:59:46 BoogieIcfgContainer [2022-11-16 19:59:46,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 19:59:46,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 19:59:46,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 19:59:46,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 19:59:46,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:59:44" (1/3) ... [2022-11-16 19:59:46,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293e839a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:59:46, skipping insertion in model container [2022-11-16 19:59:46,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:45" (2/3) ... [2022-11-16 19:59:46,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293e839a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:59:46, skipping insertion in model container [2022-11-16 19:59:46,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:59:46" (3/3) ... [2022-11-16 19:59:46,386 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 19:59:46,408 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 19:59:46,408 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-16 19:59:46,409 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 19:59:46,534 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 19:59:46,583 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 19:59:46,602 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-16 19:59:46,608 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-16 19:59:46,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 130 transitions, 275 flow [2022-11-16 19:59:46,716 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-11-16 19:59:46,717 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 19:59:46,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-16 19:59:46,728 INFO L119 LiptonReduction]: Number of co-enabled transitions 2544 [2022-11-16 19:59:56,931 INFO L134 LiptonReduction]: Checked pairs total: 6895 [2022-11-16 19:59:56,931 INFO L136 LiptonReduction]: Total number of compositions: 125 [2022-11-16 19:59:56,939 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 37 transitions, 89 flow [2022-11-16 19:59:57,062 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1540 states, 1525 states have (on average 3.4072131147540983) internal successors, (5196), 1539 states have internal predecessors, (5196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:57,082 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 19:59:57,089 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;@423b1520, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 19:59:57,089 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-16 19:59:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 1540 states, 1525 states have (on average 3.4072131147540983) internal successors, (5196), 1539 states have internal predecessors, (5196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 19:59:57,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:59:57,104 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 19:59:57,105 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 19:59:57,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:59:57,112 INFO L85 PathProgramCache]: Analyzing trace with hash 555, now seen corresponding path program 1 times [2022-11-16 19:59:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:59:57,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722068039] [2022-11-16 19:59:57,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:59:57,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 19:59:57,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:59:57,134 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 19:59:57,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 19:59:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:59:57,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 19:59:57,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:59:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:59:57,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:59:57,233 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:59:57,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722068039] [2022-11-16 19:59:57,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722068039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:59:57,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:59:57,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 19:59:57,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361942927] [2022-11-16 19:59:57,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:59:57,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 19:59:57,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:59:57,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 19:59:57,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 19:59:57,275 INFO L87 Difference]: Start difference. First operand has 1540 states, 1525 states have (on average 3.4072131147540983) internal successors, (5196), 1539 states have internal predecessors, (5196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:59:57,589 INFO L93 Difference]: Finished difference Result 1454 states and 4764 transitions. [2022-11-16 19:59:57,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 19:59:57,599 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-16 19:59:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:59:57,646 INFO L225 Difference]: With dead ends: 1454 [2022-11-16 19:59:57,646 INFO L226 Difference]: Without dead ends: 1454 [2022-11-16 19:59:57,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 19:59:57,651 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:59:57,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:59:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2022-11-16 19:59:57,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1454. [2022-11-16 19:59:57,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1449 states have (on average 3.287784679089027) internal successors, (4764), 1453 states have internal predecessors, (4764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 4764 transitions. [2022-11-16 19:59:57,858 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 4764 transitions. Word has length 1 [2022-11-16 19:59:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:59:57,859 INFO L495 AbstractCegarLoop]: Abstraction has 1454 states and 4764 transitions. [2022-11-16 19:59:57,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 4764 transitions. [2022-11-16 19:59:57,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 19:59:57,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:59:57,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 19:59:57,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 19:59:58,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 19:59:58,080 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 19:59:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:59:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash 545173, now seen corresponding path program 1 times [2022-11-16 19:59:58,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:59:58,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248649976] [2022-11-16 19:59:58,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:59:58,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 19:59:58,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:59:58,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 19:59:58,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 19:59:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:59:58,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 19:59:58,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:59:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:59:58,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:59:58,232 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:59:58,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248649976] [2022-11-16 19:59:58,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248649976] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:59:58,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:59:58,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 19:59:58,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160244124] [2022-11-16 19:59:58,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:59:58,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:59:58,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:59:58,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:59:58,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:59:58,239 INFO L87 Difference]: Start difference. First operand 1454 states and 4764 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:59:58,438 INFO L93 Difference]: Finished difference Result 1188 states and 3838 transitions. [2022-11-16 19:59:58,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:59:58,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-16 19:59:58,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:59:58,452 INFO L225 Difference]: With dead ends: 1188 [2022-11-16 19:59:58,452 INFO L226 Difference]: Without dead ends: 1152 [2022-11-16 19:59:58,453 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-16 19:59:58,457 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:59:58,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 8 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:59:58,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2022-11-16 19:59:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2022-11-16 19:59:58,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1150 states have (on average 3.253913043478261) internal successors, (3742), 1151 states have internal predecessors, (3742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 3742 transitions. [2022-11-16 19:59:58,537 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 3742 transitions. Word has length 3 [2022-11-16 19:59:58,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:59:58,537 INFO L495 AbstractCegarLoop]: Abstraction has 1152 states and 3742 transitions. [2022-11-16 19:59:58,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:58,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 3742 transitions. [2022-11-16 19:59:58,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 19:59:58,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:59:58,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:59:58,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -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-16 19:59:58,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 19:59:58,754 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 19:59:58,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:59:58,755 INFO L85 PathProgramCache]: Analyzing trace with hash 107577637, now seen corresponding path program 1 times [2022-11-16 19:59:58,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:59:58,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038673550] [2022-11-16 19:59:58,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:59:58,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 19:59:58,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:59:58,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 19:59:58,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 19:59:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:59:58,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 19:59:58,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:59:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:59:58,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:59:58,967 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:59:58,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038673550] [2022-11-16 19:59:58,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038673550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:59:58,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:59:58,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:59:58,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095342579] [2022-11-16 19:59:58,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:59:58,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 19:59:58,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:59:58,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 19:59:58,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 19:59:58,973 INFO L87 Difference]: Start difference. First operand 1152 states and 3742 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:59:59,210 INFO L93 Difference]: Finished difference Result 832 states and 2286 transitions. [2022-11-16 19:59:59,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:59:59,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 19:59:59,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:59:59,216 INFO L225 Difference]: With dead ends: 832 [2022-11-16 19:59:59,216 INFO L226 Difference]: Without dead ends: 652 [2022-11-16 19:59:59,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:59:59,220 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:59:59,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 20 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:59:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-11-16 19:59:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2022-11-16 19:59:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 650 states have (on average 2.68) internal successors, (1742), 651 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1742 transitions. [2022-11-16 19:59:59,258 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 1742 transitions. Word has length 10 [2022-11-16 19:59:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:59:59,259 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 1742 transitions. [2022-11-16 19:59:59,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1742 transitions. [2022-11-16 19:59:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 19:59:59,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:59:59,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:59:59,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 19:59:59,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 19:59:59,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 19:59:59,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:59:59,494 INFO L85 PathProgramCache]: Analyzing trace with hash 439783962, now seen corresponding path program 1 times [2022-11-16 19:59:59,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:59:59,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278002725] [2022-11-16 19:59:59,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:59:59,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 19:59:59,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:59:59,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 19:59:59,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 19:59:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:59:59,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 19:59:59,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:59:59,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:59:59,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:59:59,716 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:59:59,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278002725] [2022-11-16 19:59:59,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278002725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:59:59,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:59:59,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:59:59,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251855089] [2022-11-16 19:59:59,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:59:59,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:59:59,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:59:59,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:59:59,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:59:59,719 INFO L87 Difference]: Start difference. First operand 652 states and 1742 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:59:59,982 INFO L93 Difference]: Finished difference Result 407 states and 976 transitions. [2022-11-16 19:59:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:59:59,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 19:59:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:59:59,985 INFO L225 Difference]: With dead ends: 407 [2022-11-16 19:59:59,986 INFO L226 Difference]: Without dead ends: 327 [2022-11-16 19:59:59,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:59:59,987 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:59:59,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 36 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:59:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-16 19:59:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2022-11-16 19:59:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 325 states have (on average 2.36) internal successors, (767), 326 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:59:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 767 transitions. [2022-11-16 20:00:00,000 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 767 transitions. Word has length 14 [2022-11-16 20:00:00,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:00:00,000 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 767 transitions. [2022-11-16 20:00:00,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 767 transitions. [2022-11-16 20:00:00,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 20:00:00,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:00:00,002 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-16 20:00:00,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-16 20:00:00,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:00,215 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 20:00:00,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:00:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1117426638, now seen corresponding path program 1 times [2022-11-16 20:00:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:00:00,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803034593] [2022-11-16 20:00:00,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:00:00,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:00,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:00:00,218 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:00:00,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 20:00:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:00:00,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 20:00:00,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:00:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:00:00,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:00:00,448 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:00:00,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803034593] [2022-11-16 20:00:00,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803034593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:00:00,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:00:00,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 20:00:00,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177506322] [2022-11-16 20:00:00,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:00:00,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 20:00:00,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:00:00,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 20:00:00,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:00:00,451 INFO L87 Difference]: Start difference. First operand 327 states and 767 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:00,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:00:00,797 INFO L93 Difference]: Finished difference Result 272 states and 655 transitions. [2022-11-16 20:00:00,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 20:00:00,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-16 20:00:00,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:00:00,800 INFO L225 Difference]: With dead ends: 272 [2022-11-16 20:00:00,800 INFO L226 Difference]: Without dead ends: 257 [2022-11-16 20:00:00,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:00:00,801 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 47 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:00:00,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 60 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 20:00:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-11-16 20:00:00,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2022-11-16 20:00:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 255 states have (on average 2.458823529411765) internal successors, (627), 256 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 627 transitions. [2022-11-16 20:00:00,813 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 627 transitions. Word has length 19 [2022-11-16 20:00:00,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:00:00,813 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 627 transitions. [2022-11-16 20:00:00,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:00,814 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 627 transitions. [2022-11-16 20:00:00,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 20:00:00,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:00:00,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:00:00,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 20:00:01,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:01,028 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 20:00:01,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:00:01,029 INFO L85 PathProgramCache]: Analyzing trace with hash 43433546, now seen corresponding path program 1 times [2022-11-16 20:00:01,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:00:01,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105843036] [2022-11-16 20:00:01,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:00:01,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:01,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:00:01,031 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:00:01,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 20:00:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:00:01,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 20:00:01,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:00:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:00:01,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:00:01,438 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:00:01,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105843036] [2022-11-16 20:00:01,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105843036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:00:01,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:00:01,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 20:00:01,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385772442] [2022-11-16 20:00:01,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:00:01,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 20:00:01,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:00:01,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 20:00:01,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:00:01,441 INFO L87 Difference]: Start difference. First operand 257 states and 627 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:01,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:00:01,839 INFO L93 Difference]: Finished difference Result 375 states and 863 transitions. [2022-11-16 20:00:01,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 20:00:01,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-16 20:00:01,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:00:01,842 INFO L225 Difference]: With dead ends: 375 [2022-11-16 20:00:01,843 INFO L226 Difference]: Without dead ends: 375 [2022-11-16 20:00:01,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-16 20:00:01,844 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:00:01,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 50 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 20:00:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-11-16 20:00:01,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 336. [2022-11-16 20:00:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 334 states have (on average 2.374251497005988) internal successors, (793), 335 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 793 transitions. [2022-11-16 20:00:01,861 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 793 transitions. Word has length 24 [2022-11-16 20:00:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:00:01,861 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 793 transitions. [2022-11-16 20:00:01,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 793 transitions. [2022-11-16 20:00:01,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 20:00:01,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:00:01,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:00:01,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 20:00:02,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:02,082 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 20:00:02,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:00:02,082 INFO L85 PathProgramCache]: Analyzing trace with hash 43433584, now seen corresponding path program 1 times [2022-11-16 20:00:02,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:00:02,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952771764] [2022-11-16 20:00:02,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:00:02,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:02,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:00:02,085 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:00:02,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 20:00:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:00:02,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 20:00:02,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:00:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:00:02,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:00:02,780 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:00:02,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952771764] [2022-11-16 20:00:02,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952771764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:00:02,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:00:02,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:00:02,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038893755] [2022-11-16 20:00:02,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:00:02,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:00:02,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:00:02,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:00:02,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:00:02,783 INFO L87 Difference]: Start difference. First operand 336 states and 793 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:00:02,871 INFO L93 Difference]: Finished difference Result 589 states and 1395 transitions. [2022-11-16 20:00:02,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:00:02,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-16 20:00:02,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:00:02,876 INFO L225 Difference]: With dead ends: 589 [2022-11-16 20:00:02,876 INFO L226 Difference]: Without dead ends: 561 [2022-11-16 20:00:02,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:00:02,877 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:00:02,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 25 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2022-11-16 20:00:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-11-16 20:00:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 363. [2022-11-16 20:00:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 361 states have (on average 2.3047091412742384) internal successors, (832), 362 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 832 transitions. [2022-11-16 20:00:02,895 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 832 transitions. Word has length 24 [2022-11-16 20:00:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:00:02,896 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 832 transitions. [2022-11-16 20:00:02,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 832 transitions. [2022-11-16 20:00:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 20:00:02,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:00:02,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:00:02,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 20:00:03,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:03,114 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 20:00:03,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:00:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1703123244, now seen corresponding path program 2 times [2022-11-16 20:00:03,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:00:03,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113348380] [2022-11-16 20:00:03,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 20:00:03,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:03,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:00:03,116 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:00:03,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-16 20:00:03,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 20:00:03,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:00:03,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 20:00:03,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:00:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:00:03,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:00:03,335 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:00:03,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113348380] [2022-11-16 20:00:03,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113348380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:00:03,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:00:03,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 20:00:03,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350176105] [2022-11-16 20:00:03,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:00:03,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:00:03,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:00:03,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:00:03,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:00:03,338 INFO L87 Difference]: Start difference. First operand 363 states and 832 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:00:03,544 INFO L93 Difference]: Finished difference Result 494 states and 1098 transitions. [2022-11-16 20:00:03,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:00:03,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-16 20:00:03,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:00:03,547 INFO L225 Difference]: With dead ends: 494 [2022-11-16 20:00:03,548 INFO L226 Difference]: Without dead ends: 475 [2022-11-16 20:00:03,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:00:03,548 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:00:03,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 18 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:00:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-16 20:00:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 390. [2022-11-16 20:00:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 388 states have (on average 2.3350515463917527) internal successors, (906), 389 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 906 transitions. [2022-11-16 20:00:03,579 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 906 transitions. Word has length 24 [2022-11-16 20:00:03,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:00:03,579 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 906 transitions. [2022-11-16 20:00:03,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 906 transitions. [2022-11-16 20:00:03,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 20:00:03,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:00:03,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:00:03,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -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-16 20:00:03,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:03,800 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 20:00:03,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:00:03,801 INFO L85 PathProgramCache]: Analyzing trace with hash 78404820, now seen corresponding path program 3 times [2022-11-16 20:00:03,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:00:03,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845391169] [2022-11-16 20:00:03,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:00:03,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:03,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:00:03,803 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:00:03,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 20:00:03,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 20:00:03,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:00:03,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 20:00:03,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:00:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:00:04,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:00:04,303 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:00:04,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845391169] [2022-11-16 20:00:04,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845391169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:00:04,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:00:04,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 20:00:04,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676441860] [2022-11-16 20:00:04,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:00:04,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 20:00:04,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:00:04,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 20:00:04,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 20:00:04,305 INFO L87 Difference]: Start difference. First operand 390 states and 906 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:00:04,707 INFO L93 Difference]: Finished difference Result 445 states and 1005 transitions. [2022-11-16 20:00:04,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 20:00:04,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-16 20:00:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:00:04,710 INFO L225 Difference]: With dead ends: 445 [2022-11-16 20:00:04,710 INFO L226 Difference]: Without dead ends: 415 [2022-11-16 20:00:04,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-16 20:00:04,711 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 55 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:00:04,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 56 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 20:00:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-11-16 20:00:04,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 318. [2022-11-16 20:00:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 316 states have (on average 2.4050632911392404) internal successors, (760), 317 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 760 transitions. [2022-11-16 20:00:04,728 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 760 transitions. Word has length 24 [2022-11-16 20:00:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:00:04,728 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 760 transitions. [2022-11-16 20:00:04,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 760 transitions. [2022-11-16 20:00:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 20:00:04,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:00:04,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:00:04,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 20:00:04,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:04,943 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 20:00:04,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:00:04,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1260322458, now seen corresponding path program 2 times [2022-11-16 20:00:04,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:00:04,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750357407] [2022-11-16 20:00:04,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 20:00:04,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:04,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:00:04,945 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:00:04,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 20:00:05,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 20:00:05,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:00:05,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 20:00:05,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:00:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:00:05,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:00:05,570 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:00:05,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750357407] [2022-11-16 20:00:05,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750357407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:00:05,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:00:05,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:00:05,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823591161] [2022-11-16 20:00:05,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:00:05,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:00:05,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:00:05,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:00:05,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:00:05,571 INFO L87 Difference]: Start difference. First operand 318 states and 760 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:05,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:00:05,669 INFO L93 Difference]: Finished difference Result 519 states and 1247 transitions. [2022-11-16 20:00:05,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:00:05,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-16 20:00:05,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:00:05,673 INFO L225 Difference]: With dead ends: 519 [2022-11-16 20:00:05,673 INFO L226 Difference]: Without dead ends: 471 [2022-11-16 20:00:05,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:00:05,674 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:00:05,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 25 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2022-11-16 20:00:05,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-11-16 20:00:05,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 315. [2022-11-16 20:00:05,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 313 states have (on average 2.4089456869009584) internal successors, (754), 314 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:05,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 754 transitions. [2022-11-16 20:00:05,689 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 754 transitions. Word has length 24 [2022-11-16 20:00:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:00:05,690 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 754 transitions. [2022-11-16 20:00:05,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 754 transitions. [2022-11-16 20:00:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 20:00:05,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:00:05,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:00:05,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 20:00:05,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:05,913 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 20:00:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:00:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1043636458, now seen corresponding path program 3 times [2022-11-16 20:00:05,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:00:05,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891698067] [2022-11-16 20:00:05,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:00:05,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:05,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:00:05,917 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:00:05,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 20:00:06,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 20:00:06,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:00:06,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 20:00:06,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:00:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:00:06,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:00:06,529 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:00:06,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891698067] [2022-11-16 20:00:06,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891698067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:00:06,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:00:06,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:00:06,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369326909] [2022-11-16 20:00:06,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:00:06,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:00:06,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:00:06,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:00:06,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:00:06,531 INFO L87 Difference]: Start difference. First operand 315 states and 754 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:00:06,605 INFO L93 Difference]: Finished difference Result 566 states and 1371 transitions. [2022-11-16 20:00:06,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:00:06,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-16 20:00:06,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:00:06,608 INFO L225 Difference]: With dead ends: 566 [2022-11-16 20:00:06,609 INFO L226 Difference]: Without dead ends: 488 [2022-11-16 20:00:06,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:00:06,610 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:00:06,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 25 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2022-11-16 20:00:06,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-11-16 20:00:06,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 310. [2022-11-16 20:00:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 308 states have (on average 2.3993506493506493) internal successors, (739), 309 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 739 transitions. [2022-11-16 20:00:06,623 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 739 transitions. Word has length 24 [2022-11-16 20:00:06,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:00:06,623 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 739 transitions. [2022-11-16 20:00:06,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 739 transitions. [2022-11-16 20:00:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 20:00:06,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:00:06,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:00:06,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-16 20:00:06,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:06,838 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 20:00:06,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:00:06,838 INFO L85 PathProgramCache]: Analyzing trace with hash 112485888, now seen corresponding path program 4 times [2022-11-16 20:00:06,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:00:06,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429187699] [2022-11-16 20:00:06,839 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 20:00:06,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:06,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:00:06,842 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:00:06,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-16 20:00:07,039 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 20:00:07,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:00:07,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 20:00:07,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:00:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:00:07,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:00:07,478 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:00:07,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429187699] [2022-11-16 20:00:07,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429187699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:00:07,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:00:07,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:00:07,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956881468] [2022-11-16 20:00:07,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:00:07,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:00:07,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:00:07,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:00:07,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:00:07,480 INFO L87 Difference]: Start difference. First operand 310 states and 739 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:00:07,557 INFO L93 Difference]: Finished difference Result 511 states and 1226 transitions. [2022-11-16 20:00:07,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:00:07,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-16 20:00:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:00:07,560 INFO L225 Difference]: With dead ends: 511 [2022-11-16 20:00:07,560 INFO L226 Difference]: Without dead ends: 421 [2022-11-16 20:00:07,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:00:07,561 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:00:07,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 25 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-11-16 20:00:07,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-11-16 20:00:07,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 307. [2022-11-16 20:00:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 305 states have (on average 2.40327868852459) internal successors, (733), 306 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 733 transitions. [2022-11-16 20:00:07,575 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 733 transitions. Word has length 24 [2022-11-16 20:00:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:00:07,576 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 733 transitions. [2022-11-16 20:00:07,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 733 transitions. [2022-11-16 20:00:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 20:00:07,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:00:07,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:00:07,600 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -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)] Ended with exit code 0 [2022-11-16 20:00:07,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:07,793 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 20:00:07,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:00:07,794 INFO L85 PathProgramCache]: Analyzing trace with hash 858877488, now seen corresponding path program 5 times [2022-11-16 20:00:07,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:00:07,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722054283] [2022-11-16 20:00:07,795 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 20:00:07,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:07,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:00:07,797 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:00:07,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-16 20:00:08,034 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 20:00:08,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:00:08,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 20:00:08,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:00:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:00:08,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:00:08,453 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:00:08,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722054283] [2022-11-16 20:00:08,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722054283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:00:08,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:00:08,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:00:08,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536313229] [2022-11-16 20:00:08,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:00:08,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:00:08,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:00:08,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:00:08,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:00:08,455 INFO L87 Difference]: Start difference. First operand 307 states and 733 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:00:08,528 INFO L93 Difference]: Finished difference Result 579 states and 1387 transitions. [2022-11-16 20:00:08,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:00:08,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-16 20:00:08,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:00:08,531 INFO L225 Difference]: With dead ends: 579 [2022-11-16 20:00:08,531 INFO L226 Difference]: Without dead ends: 456 [2022-11-16 20:00:08,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:00:08,532 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:00:08,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 25 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2022-11-16 20:00:08,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-11-16 20:00:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 378. [2022-11-16 20:00:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 376 states have (on average 2.3404255319148937) internal successors, (880), 377 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 880 transitions. [2022-11-16 20:00:08,544 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 880 transitions. Word has length 24 [2022-11-16 20:00:08,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:00:08,545 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 880 transitions. [2022-11-16 20:00:08,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:00:08,545 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 880 transitions. [2022-11-16 20:00:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 20:00:08,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:00:08,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:00:08,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-16 20:00:08,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:08,759 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 20:00:08,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:00:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1251489000, now seen corresponding path program 4 times [2022-11-16 20:00:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:00:08,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28267825] [2022-11-16 20:00:08,760 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 20:00:08,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:08,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:00:08,762 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:00:08,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-16 20:00:08,937 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 20:00:08,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 20:00:08,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 20:00:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 20:00:09,096 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-16 20:00:09,110 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 20:00:09,111 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-16 20:00:09,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-16 20:00:09,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-16 20:00:09,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-16 20:00:09,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-16 20:00:09,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-16 20:00:09,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-16 20:00:09,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-16 20:00:09,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-16 20:00:09,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-16 20:00:09,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-16 20:00:09,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-16 20:00:09,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-16 20:00:09,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-16 20:00:09,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:00:09,332 INFO L444 BasicCegarLoop]: Path program histogram: [5, 4, 1, 1, 1, 1, 1] [2022-11-16 20:00:09,337 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 20:00:09,337 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 20:00:09,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:00:09 BasicIcfg [2022-11-16 20:00:09,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 20:00:09,431 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 20:00:09,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 20:00:09,431 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 20:00:09,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:59:46" (3/4) ... [2022-11-16 20:00:09,435 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 20:00:09,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 20:00:09,436 INFO L158 Benchmark]: Toolchain (without parser) took 25165.18ms. Allocated memory was 56.6MB in the beginning and 119.5MB in the end (delta: 62.9MB). Free memory was 33.0MB in the beginning and 48.9MB in the end (delta: -16.0MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2022-11-16 20:00:09,436 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 56.6MB. Free memory was 37.7MB in the beginning and 37.7MB in the end (delta: 47.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 20:00:09,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 802.08ms. Allocated memory is still 56.6MB. Free memory was 32.8MB in the beginning and 26.2MB in the end (delta: 6.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 20:00:09,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.78ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 26.2MB in the beginning and 57.7MB in the end (delta: -31.5MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-11-16 20:00:09,437 INFO L158 Benchmark]: Boogie Preprocessor took 63.18ms. Allocated memory is still 75.5MB. Free memory was 57.7MB in the beginning and 55.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 20:00:09,437 INFO L158 Benchmark]: RCFGBuilder took 1137.78ms. Allocated memory is still 75.5MB. Free memory was 55.6MB in the beginning and 54.2MB in the end (delta: 1.4MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2022-11-16 20:00:09,438 INFO L158 Benchmark]: TraceAbstraction took 23063.07ms. Allocated memory was 75.5MB in the beginning and 119.5MB in the end (delta: 44.0MB). Free memory was 53.8MB in the beginning and 48.9MB in the end (delta: 4.9MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2022-11-16 20:00:09,438 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 119.5MB. Free memory is still 48.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 20:00:09,440 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 56.6MB. Free memory was 37.7MB in the beginning and 37.7MB in the end (delta: 47.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 802.08ms. Allocated memory is still 56.6MB. Free memory was 32.8MB in the beginning and 26.2MB in the end (delta: 6.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.78ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 26.2MB in the beginning and 57.7MB in the end (delta: -31.5MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.18ms. Allocated memory is still 75.5MB. Free memory was 57.7MB in the beginning and 55.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1137.78ms. Allocated memory is still 75.5MB. Free memory was 55.6MB in the beginning and 54.2MB in the end (delta: 1.4MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23063.07ms. Allocated memory was 75.5MB in the beginning and 119.5MB in the end (delta: 44.0MB). Free memory was 53.8MB in the beginning and 48.9MB in the end (delta: 4.9MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. * Witness Printer took 4.14ms. Allocated memory is still 119.5MB. Free memory is still 48.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.3s, 138 PlacesBefore, 46 PlacesAfterwards, 130 TransitionsBefore, 37 TransitionsAfterwards, 2544 CoEnabledTransitionPairs, 6 FixpointIterations, 51 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 125 TotalNumberOfCompositions, 6895 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3863, independent: 3689, independent conditional: 0, independent unconditional: 3689, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1846, independent: 1796, independent conditional: 0, independent unconditional: 1796, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1846, independent: 1768, independent conditional: 0, independent unconditional: 1768, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 492, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 435, dependent conditional: 0, dependent unconditional: 435, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3863, independent: 1893, independent conditional: 0, independent unconditional: 1893, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 1846, unknown conditional: 0, unknown unconditional: 1846] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 244, Positive conditional cache size: 0, Positive unconditional cache size: 244, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L717] 0 int __unbuffered_p2_EBX = 0; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool weak$$choice0; [L740] 0 int z$w_buff1; [L743] 0 _Bool weak$$choice2; [L726] 0 _Bool z$flush_delayed; [L738] 0 int z$w_buff0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L711] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd3; [L727] 0 int z$mem_tmp; [L736] 0 _Bool z$read_delayed; [L715] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int *z$read_delayed_var; [L741] 0 _Bool z$w_buff1_used; [L709] 0 int __unbuffered_cnt = 0; [L719] 0 _Bool main$tmp_guard1; [L718] 0 _Bool main$tmp_guard0; [L713] 0 int __unbuffered_p1_EBX = 0; [L739] 0 _Bool z$w_buff0_used; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L843] 0 pthread_t t153; [L844] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t153, ((void *)0), P0, ((void *)0))=0, t153={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t154; [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L846] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t154, ((void *)0), P1, ((void *)0))=1, t153={3:0}, t154={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t155; [L848] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t155, ((void *)0), P2, ((void *)0))=2, t153={3:0}, t154={7:0}, t155={11:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 z$flush_delayed = weak$$choice2 [L808] 3 z$mem_tmp = z [L809] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L810] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L811] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L812] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L813] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L815] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = z [L817] 3 z = z$flush_delayed ? z$mem_tmp : z [L818] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L785] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L786] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L787] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L789] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153={3:0}, t154={7:0}, t155={11:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 159 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 22.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 334 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 334 mSDsluCounter, 377 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 155 IncrementalHoareTripleChecker+Unchecked, 263 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1251 IncrementalHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 114 mSDtfsCounter, 1251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1540occurred in iteration=0, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 945 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 226 ConstructedInterpolants, 76 QuantifiedInterpolants, 4300 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1828 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 20:00:09,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_667667f1-a8b0-433d-a803-b632aa0ef46f/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample