./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba --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 ed015c7abb1e633204d95cacfb8444fc40c913627602030095cae55094cd4434 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 01:29:14,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:29:14,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:29:14,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:29:14,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:29:14,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:29:14,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:29:14,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:29:14,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:29:14,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:29:14,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:29:14,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:29:14,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:29:14,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:29:14,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:29:14,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:29:14,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:29:14,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:29:14,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:29:14,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:29:14,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:29:14,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:29:14,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:29:14,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:29:14,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:29:14,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:29:14,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:29:14,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:29:14,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:29:14,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:29:14,140 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:29:14,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:29:14,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:29:14,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:29:14,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:29:14,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:29:14,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:29:14,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:29:14,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:29:14,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:29:14,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:29:14,153 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-22 01:29:14,193 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:29:14,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:29:14,195 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:29:14,195 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:29:14,196 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:29:14,196 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:29:14,196 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:29:14,197 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:29:14,197 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:29:14,197 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:29:14,198 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:29:14,199 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:29:14,199 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:29:14,199 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:29:14,199 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:29:14,199 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:29:14,200 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:29:14,200 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:29:14,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 01:29:14,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 01:29:14,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:29:14,201 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:29:14,202 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:29:14,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:29:14,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:29:14,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:29:14,203 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 01:29:14,203 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 01:29:14,204 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 01:29:14,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:29:14,204 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 01:29:14,205 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:29:14,205 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:29:14,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:29:14,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:29:14,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:29:14,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:29:14,206 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:29:14,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:29:14,206 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:29:14,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:29:14,207 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:29:14,207 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_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/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_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba 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 -> ed015c7abb1e633204d95cacfb8444fc40c913627602030095cae55094cd4434 [2022-11-22 01:29:14,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:29:14,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:29:14,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:29:14,570 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:29:14,570 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:29:14,572 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2022-11-22 01:29:17,773 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:29:18,095 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:29:18,096 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2022-11-22 01:29:18,112 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/data/6684aff71/a57fd5c80b2f4d789b130a8802e52a7f/FLAG6daf4df4b [2022-11-22 01:29:18,137 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/data/6684aff71/a57fd5c80b2f4d789b130a8802e52a7f [2022-11-22 01:29:18,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:29:18,146 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:29:18,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:29:18,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:29:18,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:29:18,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:29:18" (1/1) ... [2022-11-22 01:29:18,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba4ea03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:18, skipping insertion in model container [2022-11-22 01:29:18,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:29:18" (1/1) ... [2022-11-22 01:29:18,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:29:18,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:29:18,423 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2022-11-22 01:29:18,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:29:18,796 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:29:18,812 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2022-11-22 01:29:18,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:29:18,915 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:29:18,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:18 WrapperNode [2022-11-22 01:29:18,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:29:18,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:29:18,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:29:18,917 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:29:18,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:18" (1/1) ... [2022-11-22 01:29:18,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:18" (1/1) ... [2022-11-22 01:29:18,990 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2022-11-22 01:29:18,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:29:18,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:29:18,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:29:18,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:29:19,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:18" (1/1) ... [2022-11-22 01:29:19,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:18" (1/1) ... [2022-11-22 01:29:19,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:18" (1/1) ... [2022-11-22 01:29:19,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:18" (1/1) ... [2022-11-22 01:29:19,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:18" (1/1) ... [2022-11-22 01:29:19,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:18" (1/1) ... [2022-11-22 01:29:19,023 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:18" (1/1) ... [2022-11-22 01:29:19,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:18" (1/1) ... [2022-11-22 01:29:19,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:29:19,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:29:19,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:29:19,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:29:19,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:18" (1/1) ... [2022-11-22 01:29:19,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:29:19,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:29:19,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:29:19,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:29:19,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 01:29:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 01:29:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:29:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:29:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:29:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 01:29:19,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 01:29:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 01:29:19,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 01:29:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:29:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 01:29:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:29:19,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:29:19,123 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 01:29:19,272 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:29:19,274 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:29:19,677 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:29:19,834 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:29:19,834 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 01:29:19,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:29:19 BoogieIcfgContainer [2022-11-22 01:29:19,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:29:19,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:29:19,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:29:19,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:29:19,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:29:18" (1/3) ... [2022-11-22 01:29:19,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3851dc4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:29:19, skipping insertion in model container [2022-11-22 01:29:19,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:18" (2/3) ... [2022-11-22 01:29:19,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3851dc4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:29:19, skipping insertion in model container [2022-11-22 01:29:19,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:29:19" (3/3) ... [2022-11-22 01:29:19,848 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt_pso.opt_rmo.opt.i [2022-11-22 01:29:19,872 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:29:19,872 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-22 01:29:19,872 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 01:29:19,964 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 01:29:19,998 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 01:29:20,017 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 105 transitions, 220 flow [2022-11-22 01:29:20,020 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 105 transitions, 220 flow [2022-11-22 01:29:20,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 105 transitions, 220 flow [2022-11-22 01:29:20,091 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-11-22 01:29:20,092 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 01:29:20,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2022-11-22 01:29:20,099 INFO L119 LiptonReduction]: Number of co-enabled transitions 1422 [2022-11-22 01:29:27,730 INFO L134 LiptonReduction]: Checked pairs total: 3911 [2022-11-22 01:29:27,731 INFO L136 LiptonReduction]: Total number of compositions: 111 [2022-11-22 01:29:27,742 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 26 transitions, 62 flow [2022-11-22 01:29:27,782 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 234 states, 225 states have (on average 2.48) internal successors, (558), 233 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:27,811 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:29:27,818 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;@7b266e15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:29:27,818 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-22 01:29:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 225 states have (on average 2.48) internal successors, (558), 233 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:27,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 01:29:27,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:27,829 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 01:29:27,829 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:27,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:27,836 INFO L85 PathProgramCache]: Analyzing trace with hash 471, now seen corresponding path program 1 times [2022-11-22 01:29:27,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:29:27,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881501120] [2022-11-22 01:29:27,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:27,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:29:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:28,016 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-22 01:29:28,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:29:28,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881501120] [2022-11-22 01:29:28,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881501120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:28,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:28,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 01:29:28,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516900193] [2022-11-22 01:29:28,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:28,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 01:29:28,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:29:28,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 01:29:28,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 01:29:28,066 INFO L87 Difference]: Start difference. First operand has 234 states, 225 states have (on average 2.48) internal successors, (558), 233 states have internal predecessors, (558), 0 states have call successors, (0), 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-22 01:29:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:28,165 INFO L93 Difference]: Finished difference Result 222 states and 538 transitions. [2022-11-22 01:29:28,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 01:29:28,168 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-22 01:29:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:28,189 INFO L225 Difference]: With dead ends: 222 [2022-11-22 01:29:28,189 INFO L226 Difference]: Without dead ends: 222 [2022-11-22 01:29:28,190 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-22 01:29:28,196 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:28,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:29:28,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-22 01:29:28,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-11-22 01:29:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 2.47926267281106) internal successors, (538), 221 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 538 transitions. [2022-11-22 01:29:28,285 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 538 transitions. Word has length 1 [2022-11-22 01:29:28,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:28,285 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 538 transitions. [2022-11-22 01:29:28,286 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-22 01:29:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 538 transitions. [2022-11-22 01:29:28,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:29:28,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:28,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:29:28,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:29:28,293 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:28,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:28,294 INFO L85 PathProgramCache]: Analyzing trace with hash 446231755, now seen corresponding path program 1 times [2022-11-22 01:29:28,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:29:28,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581702607] [2022-11-22 01:29:28,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:28,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:29:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:28,745 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-22 01:29:28,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:29:28,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581702607] [2022-11-22 01:29:28,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581702607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:28,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:28,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:29:28,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519574573] [2022-11-22 01:29:28,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:28,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:29:28,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:29:28,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:29:28,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:29:28,758 INFO L87 Difference]: Start difference. First operand 222 states and 538 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:28,853 INFO L93 Difference]: Finished difference Result 192 states and 459 transitions. [2022-11-22 01:29:28,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:29:28,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-22 01:29:28,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:28,858 INFO L225 Difference]: With dead ends: 192 [2022-11-22 01:29:28,858 INFO L226 Difference]: Without dead ends: 187 [2022-11-22 01:29:28,859 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-22 01:29:28,860 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:28,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:29:28,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-22 01:29:28,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-11-22 01:29:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 185 states have (on average 2.4324324324324325) internal successors, (450), 186 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 450 transitions. [2022-11-22 01:29:28,880 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 450 transitions. Word has length 5 [2022-11-22 01:29:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:28,880 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 450 transitions. [2022-11-22 01:29:28,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 450 transitions. [2022-11-22 01:29:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 01:29:28,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:28,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:28,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:29:28,883 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:28,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:28,883 INFO L85 PathProgramCache]: Analyzing trace with hash -667956231, now seen corresponding path program 1 times [2022-11-22 01:29:28,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:29:28,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210987033] [2022-11-22 01:29:28,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:28,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:29:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:29,557 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-22 01:29:29,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:29:29,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210987033] [2022-11-22 01:29:29,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210987033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:29,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:29,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:29:29,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660394107] [2022-11-22 01:29:29,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:29,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:29:29,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:29:29,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:29:29,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:29:29,559 INFO L87 Difference]: Start difference. First operand 187 states and 450 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:29,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:29,731 INFO L93 Difference]: Finished difference Result 268 states and 625 transitions. [2022-11-22 01:29:29,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:29:29,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-22 01:29:29,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:29,735 INFO L225 Difference]: With dead ends: 268 [2022-11-22 01:29:29,735 INFO L226 Difference]: Without dead ends: 268 [2022-11-22 01:29:29,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:29:29,737 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:29,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:29:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-11-22 01:29:29,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 200. [2022-11-22 01:29:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 198 states have (on average 2.4545454545454546) internal successors, (486), 199 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 486 transitions. [2022-11-22 01:29:29,753 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 486 transitions. Word has length 7 [2022-11-22 01:29:29,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:29,754 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 486 transitions. [2022-11-22 01:29:29,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 486 transitions. [2022-11-22 01:29:29,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 01:29:29,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:29,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:29,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:29:29,756 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:29,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:29,756 INFO L85 PathProgramCache]: Analyzing trace with hash -667956212, now seen corresponding path program 1 times [2022-11-22 01:29:29,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:29:29,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372350361] [2022-11-22 01:29:29,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:29,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:29:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:30,151 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-22 01:29:30,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:29:30,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372350361] [2022-11-22 01:29:30,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372350361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:30,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:30,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:29:30,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136999963] [2022-11-22 01:29:30,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:30,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:29:30,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:29:30,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:29:30,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:29:30,163 INFO L87 Difference]: Start difference. First operand 200 states and 486 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:30,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:30,228 INFO L93 Difference]: Finished difference Result 165 states and 378 transitions. [2022-11-22 01:29:30,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:29:30,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-22 01:29:30,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:30,231 INFO L225 Difference]: With dead ends: 165 [2022-11-22 01:29:30,231 INFO L226 Difference]: Without dead ends: 165 [2022-11-22 01:29:30,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:29:30,234 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:30,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 9 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:29:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-22 01:29:30,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-11-22 01:29:30,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 2.3048780487804876) internal successors, (378), 164 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:30,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 378 transitions. [2022-11-22 01:29:30,253 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 378 transitions. Word has length 7 [2022-11-22 01:29:30,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:30,254 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 378 transitions. [2022-11-22 01:29:30,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:30,254 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 378 transitions. [2022-11-22 01:29:30,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:29:30,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:30,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:30,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:29:30,256 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:30,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash -387622129, now seen corresponding path program 1 times [2022-11-22 01:29:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:29:30,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134068508] [2022-11-22 01:29:30,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:30,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:29:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:30,838 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-22 01:29:30,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:29:30,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134068508] [2022-11-22 01:29:30,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134068508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:30,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:30,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:29:30,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175267541] [2022-11-22 01:29:30,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:30,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:29:30,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:29:30,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:29:30,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:29:30,840 INFO L87 Difference]: Start difference. First operand 165 states and 378 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:30,939 INFO L93 Difference]: Finished difference Result 155 states and 350 transitions. [2022-11-22 01:29:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:29:30,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-22 01:29:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:30,940 INFO L225 Difference]: With dead ends: 155 [2022-11-22 01:29:30,941 INFO L226 Difference]: Without dead ends: 155 [2022-11-22 01:29:30,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:29:30,942 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:30,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 5 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:29:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-22 01:29:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 137. [2022-11-22 01:29:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.2794117647058822) internal successors, (310), 136 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 310 transitions. [2022-11-22 01:29:30,955 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 310 transitions. Word has length 8 [2022-11-22 01:29:30,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:30,955 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 310 transitions. [2022-11-22 01:29:30,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 310 transitions. [2022-11-22 01:29:30,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:29:30,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:30,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:30,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:29:30,960 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:30,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:30,962 INFO L85 PathProgramCache]: Analyzing trace with hash -111927632, now seen corresponding path program 1 times [2022-11-22 01:29:30,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:29:30,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034996255] [2022-11-22 01:29:30,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:30,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:29:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:31,445 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-22 01:29:31,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:29:31,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034996255] [2022-11-22 01:29:31,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034996255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:31,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:31,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:29:31,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123088048] [2022-11-22 01:29:31,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:31,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:29:31,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:29:31,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:29:31,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:29:31,447 INFO L87 Difference]: Start difference. First operand 137 states and 310 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) 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-22 01:29:31,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:31,590 INFO L93 Difference]: Finished difference Result 218 states and 493 transitions. [2022-11-22 01:29:31,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:29:31,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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-22 01:29:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:31,592 INFO L225 Difference]: With dead ends: 218 [2022-11-22 01:29:31,592 INFO L226 Difference]: Without dead ends: 122 [2022-11-22 01:29:31,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:29:31,593 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:31,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 5 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:29:31,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-22 01:29:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2022-11-22 01:29:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.2) internal successors, (220), 100 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 220 transitions. [2022-11-22 01:29:31,599 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 220 transitions. Word has length 11 [2022-11-22 01:29:31,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:31,599 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 220 transitions. [2022-11-22 01:29:31,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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-22 01:29:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 220 transitions. [2022-11-22 01:29:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:29:31,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:31,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:31,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 01:29:31,601 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:31,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:31,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1445272292, now seen corresponding path program 1 times [2022-11-22 01:29:31,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:29:31,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996794681] [2022-11-22 01:29:31,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:31,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:29:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:32,300 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-22 01:29:32,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:29:32,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996794681] [2022-11-22 01:29:32,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996794681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:32,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:32,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:29:32,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235455402] [2022-11-22 01:29:32,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:32,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:29:32,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:29:32,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:29:32,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:29:32,303 INFO L87 Difference]: Start difference. First operand 101 states and 220 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-22 01:29:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:32,420 INFO L93 Difference]: Finished difference Result 100 states and 217 transitions. [2022-11-22 01:29:32,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:29:32,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-22 01:29:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:32,422 INFO L225 Difference]: With dead ends: 100 [2022-11-22 01:29:32,422 INFO L226 Difference]: Without dead ends: 100 [2022-11-22 01:29:32,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:29:32,423 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:32,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:29:32,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-22 01:29:32,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-11-22 01:29:32,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.191919191919192) internal successors, (217), 99 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 217 transitions. [2022-11-22 01:29:32,427 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 217 transitions. Word has length 12 [2022-11-22 01:29:32,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:32,428 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 217 transitions. [2022-11-22 01:29:32,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-22 01:29:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 217 transitions. [2022-11-22 01:29:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:29:32,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:32,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:32,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:29:32,432 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:32,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:32,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1852415726, now seen corresponding path program 1 times [2022-11-22 01:29:32,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:29:32,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744896528] [2022-11-22 01:29:32,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:32,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:29:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:32,691 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-22 01:29:32,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:29:32,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744896528] [2022-11-22 01:29:32,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744896528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:32,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:32,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:29:32,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445457334] [2022-11-22 01:29:32,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:32,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:29:32,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:29:32,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:29:32,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:29:32,693 INFO L87 Difference]: Start difference. First operand 100 states and 217 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:32,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:32,776 INFO L93 Difference]: Finished difference Result 136 states and 292 transitions. [2022-11-22 01:29:32,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:29:32,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 01:29:32,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:32,778 INFO L225 Difference]: With dead ends: 136 [2022-11-22 01:29:32,778 INFO L226 Difference]: Without dead ends: 72 [2022-11-22 01:29:32,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:29:32,779 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:32,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 8 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:29:32,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-22 01:29:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-22 01:29:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 2.056338028169014) internal successors, (146), 71 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 146 transitions. [2022-11-22 01:29:32,783 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 146 transitions. Word has length 13 [2022-11-22 01:29:32,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:32,783 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 146 transitions. [2022-11-22 01:29:32,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:32,784 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 146 transitions. [2022-11-22 01:29:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:29:32,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:32,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:32,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 01:29:32,785 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:32,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:32,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1853770736, now seen corresponding path program 2 times [2022-11-22 01:29:32,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:29:32,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751822062] [2022-11-22 01:29:32,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:32,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:29:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:33,021 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-22 01:29:33,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:29:33,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751822062] [2022-11-22 01:29:33,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751822062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:33,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:33,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:29:33,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137909797] [2022-11-22 01:29:33,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:33,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:29:33,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:29:33,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:29:33,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:29:33,030 INFO L87 Difference]: Start difference. First operand 72 states and 146 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:33,117 INFO L93 Difference]: Finished difference Result 62 states and 105 transitions. [2022-11-22 01:29:33,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:29:33,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 01:29:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:33,119 INFO L225 Difference]: With dead ends: 62 [2022-11-22 01:29:33,119 INFO L226 Difference]: Without dead ends: 43 [2022-11-22 01:29:33,119 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-22 01:29:33,120 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:33,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 14 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:29:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-22 01:29:33,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-22 01:29:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 42 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2022-11-22 01:29:33,122 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 13 [2022-11-22 01:29:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:33,123 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2022-11-22 01:29:33,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-11-22 01:29:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:29:33,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:33,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:33,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:29:33,124 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:33,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1003675100, now seen corresponding path program 1 times [2022-11-22 01:29:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:29:33,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253399836] [2022-11-22 01:29:33,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:33,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:29:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:33,394 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-22 01:29:33,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:29:33,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253399836] [2022-11-22 01:29:33,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253399836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:33,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:33,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:29:33,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111442092] [2022-11-22 01:29:33,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:33,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:29:33,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:29:33,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:29:33,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:29:33,402 INFO L87 Difference]: Start difference. First operand 43 states and 67 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-22 01:29:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:33,520 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-11-22 01:29:33,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:29:33,521 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-22 01:29:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:33,522 INFO L225 Difference]: With dead ends: 33 [2022-11-22 01:29:33,522 INFO L226 Difference]: Without dead ends: 26 [2022-11-22 01:29:33,522 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-22 01:29:33,523 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:33,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:29:33,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-22 01:29:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-22 01:29:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-11-22 01:29:33,525 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2022-11-22 01:29:33,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:33,525 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-22 01:29:33,525 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-22 01:29:33,526 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-11-22 01:29:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:29:33,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:33,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:33,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 01:29:33,526 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:33,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:33,527 INFO L85 PathProgramCache]: Analyzing trace with hash 426278443, now seen corresponding path program 1 times [2022-11-22 01:29:33,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:29:33,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635831553] [2022-11-22 01:29:33,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:33,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:29:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:35,044 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-22 01:29:35,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:29:35,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635831553] [2022-11-22 01:29:35,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635831553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:35,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:35,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:29:35,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185239541] [2022-11-22 01:29:35,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:35,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 01:29:35,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:29:35,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 01:29:35,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:29:35,046 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-22 01:29:35,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:35,261 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-11-22 01:29:35,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:29:35,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-22 01:29:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:35,263 INFO L225 Difference]: With dead ends: 34 [2022-11-22 01:29:35,263 INFO L226 Difference]: Without dead ends: 22 [2022-11-22 01:29:35,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:29:35,264 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:35,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 15 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:29:35,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-22 01:29:35,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-22 01:29:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-11-22 01:29:35,266 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2022-11-22 01:29:35,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:35,266 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-11-22 01:29:35,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-22 01:29:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-11-22 01:29:35,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:29:35,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:35,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:35,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 01:29:35,267 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:35,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:35,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2100989529, now seen corresponding path program 2 times [2022-11-22 01:29:35,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:29:35,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541000033] [2022-11-22 01:29:35,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:35,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:29:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:29:35,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 01:29:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:29:35,423 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 01:29:35,424 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 01:29:35,425 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-22 01:29:35,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-22 01:29:35,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-22 01:29:35,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-22 01:29:35,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-22 01:29:35,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-22 01:29:35,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-22 01:29:35,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-22 01:29:35,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-22 01:29:35,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-22 01:29:35,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 01:29:35,432 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:35,439 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 01:29:35,439 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:29:35,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:29:35 BasicIcfg [2022-11-22 01:29:35,518 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:29:35,519 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:29:35,519 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:29:35,520 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:29:35,520 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:29:19" (3/4) ... [2022-11-22 01:29:35,524 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-22 01:29:35,524 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:29:35,525 INFO L158 Benchmark]: Toolchain (without parser) took 17378.85ms. Allocated memory was 113.2MB in the beginning and 308.3MB in the end (delta: 195.0MB). Free memory was 59.9MB in the beginning and 237.0MB in the end (delta: -177.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-11-22 01:29:35,526 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 113.2MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:29:35,526 INFO L158 Benchmark]: CACSL2BoogieTranslator took 764.71ms. Allocated memory was 113.2MB in the beginning and 176.2MB in the end (delta: 62.9MB). Free memory was 59.7MB in the beginning and 140.5MB in the end (delta: -80.8MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-11-22 01:29:35,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.74ms. Allocated memory is still 176.2MB. Free memory was 140.5MB in the beginning and 138.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:29:35,527 INFO L158 Benchmark]: Boogie Preprocessor took 37.09ms. Allocated memory is still 176.2MB. Free memory was 138.3MB in the beginning and 136.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:29:35,528 INFO L158 Benchmark]: RCFGBuilder took 808.51ms. Allocated memory is still 176.2MB. Free memory was 136.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-22 01:29:35,528 INFO L158 Benchmark]: TraceAbstraction took 15678.40ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 103.9MB in the beginning and 237.0MB in the end (delta: -133.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:29:35,529 INFO L158 Benchmark]: Witness Printer took 5.42ms. Allocated memory is still 308.3MB. Free memory is still 237.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:29:35,532 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 113.2MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 764.71ms. Allocated memory was 113.2MB in the beginning and 176.2MB in the end (delta: 62.9MB). Free memory was 59.7MB in the beginning and 140.5MB in the end (delta: -80.8MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.74ms. Allocated memory is still 176.2MB. Free memory was 140.5MB in the beginning and 138.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.09ms. Allocated memory is still 176.2MB. Free memory was 138.3MB in the beginning and 136.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 808.51ms. Allocated memory is still 176.2MB. Free memory was 136.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15678.40ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 103.9MB in the beginning and 237.0MB in the end (delta: -133.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.42ms. Allocated memory is still 308.3MB. Free memory is still 237.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 110 PlacesBefore, 33 PlacesAfterwards, 105 TransitionsBefore, 26 TransitionsAfterwards, 1422 CoEnabledTransitionPairs, 6 FixpointIterations, 51 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 111 TotalNumberOfCompositions, 3911 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2249, independent: 2099, independent conditional: 0, independent unconditional: 2099, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1125, independent: 1061, independent conditional: 0, independent unconditional: 1061, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1125, independent: 1046, independent conditional: 0, independent unconditional: 1046, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 669, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 624, dependent conditional: 0, dependent unconditional: 624, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2249, independent: 1038, independent conditional: 0, independent unconditional: 1038, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 1125, unknown conditional: 0, unknown unconditional: 1125] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 81, Positive conditional cache size: 0, Positive unconditional cache size: 81, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1587; [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1587, ((void *)0), P0, ((void *)0))=0, t1587={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1588; [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1588, ((void *)0), P1, ((void *)0))=1, t1587={5:0}, t1588={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L807] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L807] RET 0 assume_abort_if_not(main$tmp_guard0) [L809] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1587={5:0}, t1588={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 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: 798]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 801]: 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: 803]: 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 5 procedures, 125 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 470 IncrementalHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 50 mSDtfsCounter, 470 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=0, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 107 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 1359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-22 01:29:35,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba --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 ed015c7abb1e633204d95cacfb8444fc40c913627602030095cae55094cd4434 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 01:29:38,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:29:38,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:29:38,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:29:38,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:29:38,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:29:38,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:29:38,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:29:38,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:29:38,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:29:38,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:29:38,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:29:38,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:29:38,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:29:38,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:29:38,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:29:38,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:29:38,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:29:38,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:29:38,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:29:38,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:29:38,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:29:38,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:29:38,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:29:38,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:29:38,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:29:38,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:29:38,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:29:38,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:29:38,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:29:38,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:29:38,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:29:38,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:29:38,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:29:38,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:29:38,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:29:38,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:29:38,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:29:38,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:29:38,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:29:38,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:29:38,424 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-22 01:29:38,468 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:29:38,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:29:38,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:29:38,470 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:29:38,471 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:29:38,471 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:29:38,471 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:29:38,471 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:29:38,472 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:29:38,472 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:29:38,473 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:29:38,473 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:29:38,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 01:29:38,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 01:29:38,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:29:38,475 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:29:38,475 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:29:38,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:29:38,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:29:38,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:29:38,477 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 01:29:38,477 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 01:29:38,477 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 01:29:38,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:29:38,478 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 01:29:38,478 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-22 01:29:38,478 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-22 01:29:38,478 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:29:38,479 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:29:38,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:29:38,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-22 01:29:38,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:29:38,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:29:38,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:29:38,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:29:38,481 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-22 01:29:38,481 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-22 01:29:38,482 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:29:38,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-22 01:29:38,482 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_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/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_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba 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 -> ed015c7abb1e633204d95cacfb8444fc40c913627602030095cae55094cd4434 [2022-11-22 01:29:38,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:29:38,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:29:38,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:29:38,888 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:29:38,889 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:29:38,891 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2022-11-22 01:29:42,068 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:29:42,505 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:29:42,506 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2022-11-22 01:29:42,530 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/data/e44140b11/c42afac9e7e74f10964b4eef518c3ed8/FLAG9ac46f4d1 [2022-11-22 01:29:42,553 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/data/e44140b11/c42afac9e7e74f10964b4eef518c3ed8 [2022-11-22 01:29:42,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:29:42,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:29:42,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:29:42,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:29:42,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:29:42,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:29:42" (1/1) ... [2022-11-22 01:29:42,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ec737c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:42, skipping insertion in model container [2022-11-22 01:29:42,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:29:42" (1/1) ... [2022-11-22 01:29:42,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:29:42,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:29:42,894 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2022-11-22 01:29:43,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:29:43,258 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:29:43,277 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2022-11-22 01:29:43,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:29:43,446 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:29:43,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:43 WrapperNode [2022-11-22 01:29:43,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:29:43,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:29:43,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:29:43,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:29:43,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:43" (1/1) ... [2022-11-22 01:29:43,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:43" (1/1) ... [2022-11-22 01:29:43,530 INFO L138 Inliner]: procedures = 178, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2022-11-22 01:29:43,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:29:43,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:29:43,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:29:43,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:29:43,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:43" (1/1) ... [2022-11-22 01:29:43,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:43" (1/1) ... [2022-11-22 01:29:43,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:43" (1/1) ... [2022-11-22 01:29:43,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:43" (1/1) ... [2022-11-22 01:29:43,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:43" (1/1) ... [2022-11-22 01:29:43,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:43" (1/1) ... [2022-11-22 01:29:43,566 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:43" (1/1) ... [2022-11-22 01:29:43,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:43" (1/1) ... [2022-11-22 01:29:43,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:29:43,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:29:43,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:29:43,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:29:43,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:43" (1/1) ... [2022-11-22 01:29:43,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:29:43,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:29:43,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:29:43,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:29:43,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 01:29:43,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:29:43,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:29:43,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:29:43,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-22 01:29:43,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-22 01:29:43,680 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 01:29:43,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 01:29:43,680 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 01:29:43,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 01:29:43,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 01:29:43,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:29:43,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:29:43,683 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 01:29:43,947 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:29:43,949 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:29:44,448 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:29:44,752 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:29:44,753 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 01:29:44,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:29:44 BoogieIcfgContainer [2022-11-22 01:29:44,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:29:44,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:29:44,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:29:44,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:29:44,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:29:42" (1/3) ... [2022-11-22 01:29:44,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717977e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:29:44, skipping insertion in model container [2022-11-22 01:29:44,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:43" (2/3) ... [2022-11-22 01:29:44,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717977e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:29:44, skipping insertion in model container [2022-11-22 01:29:44,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:29:44" (3/3) ... [2022-11-22 01:29:44,768 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt_pso.opt_rmo.opt.i [2022-11-22 01:29:44,807 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:29:44,807 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-22 01:29:44,807 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 01:29:44,897 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 01:29:44,953 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 01:29:44,985 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 106 transitions, 222 flow [2022-11-22 01:29:44,988 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 106 transitions, 222 flow [2022-11-22 01:29:44,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 106 transitions, 222 flow [2022-11-22 01:29:45,077 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-11-22 01:29:45,077 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 01:29:45,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2022-11-22 01:29:45,086 INFO L119 LiptonReduction]: Number of co-enabled transitions 1422 [2022-11-22 01:29:54,267 INFO L134 LiptonReduction]: Checked pairs total: 4167 [2022-11-22 01:29:54,267 INFO L136 LiptonReduction]: Total number of compositions: 105 [2022-11-22 01:29:54,276 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 66 flow [2022-11-22 01:29:54,321 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 274 states, 265 states have (on average 2.660377358490566) internal successors, (705), 273 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:54,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:29:54,349 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;@238e39b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:29:54,350 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-22 01:29:54,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 274 states, 265 states have (on average 2.660377358490566) internal successors, (705), 273 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:54,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 01:29:54,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:54,361 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 01:29:54,362 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:54,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:54,368 INFO L85 PathProgramCache]: Analyzing trace with hash 470, now seen corresponding path program 1 times [2022-11-22 01:29:54,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:29:54,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709952586] [2022-11-22 01:29:54,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:54,385 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-22 01:29:54,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:29:54,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:54,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:54,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-22 01:29:54,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:29:54,502 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-22 01:29:54,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:29:54,504 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:29:54,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709952586] [2022-11-22 01:29:54,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709952586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:54,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:54,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 01:29:54,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247258955] [2022-11-22 01:29:54,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:54,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 01:29:54,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:29:54,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 01:29:54,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 01:29:54,554 INFO L87 Difference]: Start difference. First operand has 274 states, 265 states have (on average 2.660377358490566) internal successors, (705), 273 states have internal predecessors, (705), 0 states have call successors, (0), 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-22 01:29:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:54,655 INFO L93 Difference]: Finished difference Result 262 states and 645 transitions. [2022-11-22 01:29:54,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 01:29:54,671 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-22 01:29:54,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:54,693 INFO L225 Difference]: With dead ends: 262 [2022-11-22 01:29:54,694 INFO L226 Difference]: Without dead ends: 262 [2022-11-22 01:29:54,695 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-22 01:29:54,698 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:54,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:29:54,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-22 01:29:54,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-11-22 01:29:54,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 257 states have (on average 2.509727626459144) internal successors, (645), 261 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 645 transitions. [2022-11-22 01:29:54,852 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 645 transitions. Word has length 1 [2022-11-22 01:29:54,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:54,853 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 645 transitions. [2022-11-22 01:29:54,854 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-22 01:29:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 645 transitions. [2022-11-22 01:29:54,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:29:54,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:54,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:29:54,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-22 01:29:55,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:55,067 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:55,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:55,068 INFO L85 PathProgramCache]: Analyzing trace with hash 443519877, now seen corresponding path program 1 times [2022-11-22 01:29:55,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:29:55,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366246224] [2022-11-22 01:29:55,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:55,070 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-22 01:29:55,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:29:55,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:55,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:55,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:29:55,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:29:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:29:55,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:29:55,228 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:29:55,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366246224] [2022-11-22 01:29:55,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366246224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:55,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:55,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:29:55,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105457310] [2022-11-22 01:29:55,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:55,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:29:55,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:29:55,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:29:55,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:29:55,238 INFO L87 Difference]: Start difference. First operand 262 states and 645 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:55,343 INFO L93 Difference]: Finished difference Result 227 states and 552 transitions. [2022-11-22 01:29:55,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:29:55,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-22 01:29:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:55,347 INFO L225 Difference]: With dead ends: 227 [2022-11-22 01:29:55,347 INFO L226 Difference]: Without dead ends: 222 [2022-11-22 01:29:55,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:29:55,349 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:55,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:29:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-22 01:29:55,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-11-22 01:29:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 220 states have (on average 2.4681818181818183) internal successors, (543), 221 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 543 transitions. [2022-11-22 01:29:55,370 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 543 transitions. Word has length 5 [2022-11-22 01:29:55,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:55,371 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 543 transitions. [2022-11-22 01:29:55,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:55,371 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 543 transitions. [2022-11-22 01:29:55,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:29:55,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:55,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:55,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:55,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:55,585 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:55,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:55,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1583186246, now seen corresponding path program 1 times [2022-11-22 01:29:55,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:29:55,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516763678] [2022-11-22 01:29:55,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:55,587 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-22 01:29:55,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:29:55,589 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:55,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:55,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:29:55,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:29:55,747 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-22 01:29:55,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:29:55,749 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:29:55,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516763678] [2022-11-22 01:29:55,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516763678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:55,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:55,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:29:55,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806031962] [2022-11-22 01:29:55,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:55,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:29:55,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:29:55,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:29:55,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:29:55,753 INFO L87 Difference]: Start difference. First operand 222 states and 543 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:55,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:55,833 INFO L93 Difference]: Finished difference Result 102 states and 183 transitions. [2022-11-22 01:29:55,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:29:55,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-22 01:29:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:55,837 INFO L225 Difference]: With dead ends: 102 [2022-11-22 01:29:55,837 INFO L226 Difference]: Without dead ends: 102 [2022-11-22 01:29:55,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-22 01:29:55,838 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:55,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:29:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-22 01:29:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-22 01:29:55,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.83) internal successors, (183), 101 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 183 transitions. [2022-11-22 01:29:55,888 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 183 transitions. Word has length 8 [2022-11-22 01:29:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:55,889 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 183 transitions. [2022-11-22 01:29:55,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 183 transitions. [2022-11-22 01:29:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:29:55,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:55,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:55,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:56,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:56,101 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:56,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash 665446816, now seen corresponding path program 1 times [2022-11-22 01:29:56,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:29:56,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570588461] [2022-11-22 01:29:56,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:56,104 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-22 01:29:56,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:29:56,105 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:56,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:56,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:29:56,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:29:56,306 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-22 01:29:56,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:29:56,307 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:29:56,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570588461] [2022-11-22 01:29:56,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570588461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:56,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:56,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:29:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681259449] [2022-11-22 01:29:56,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:56,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:29:56,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:29:56,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:29:56,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:29:56,312 INFO L87 Difference]: Start difference. First operand 102 states and 183 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:56,434 INFO L93 Difference]: Finished difference Result 52 states and 83 transitions. [2022-11-22 01:29:56,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:29:56,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 01:29:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:56,436 INFO L225 Difference]: With dead ends: 52 [2022-11-22 01:29:56,436 INFO L226 Difference]: Without dead ends: 52 [2022-11-22 01:29:56,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:29:56,438 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:56,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 16 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:29:56,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-22 01:29:56,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-22 01:29:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.66) internal successors, (83), 51 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 83 transitions. [2022-11-22 01:29:56,454 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 83 transitions. Word has length 12 [2022-11-22 01:29:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:56,455 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 83 transitions. [2022-11-22 01:29:56,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 83 transitions. [2022-11-22 01:29:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 01:29:56,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:56,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:56,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:56,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:56,658 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:56,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:56,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1507545302, now seen corresponding path program 1 times [2022-11-22 01:29:56,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:29:56,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314915996] [2022-11-22 01:29:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:56,659 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-22 01:29:56,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:29:56,660 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:56,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:56,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-22 01:29:56,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:29:57,090 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-22 01:29:57,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:29:57,090 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:29:57,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314915996] [2022-11-22 01:29:57,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314915996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:57,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:57,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:29:57,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95583789] [2022-11-22 01:29:57,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:57,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:29:57,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:29:57,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:29:57,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:29:57,094 INFO L87 Difference]: Start difference. First operand 52 states and 83 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:57,210 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2022-11-22 01:29:57,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:29:57,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-22 01:29:57,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:57,212 INFO L225 Difference]: With dead ends: 51 [2022-11-22 01:29:57,212 INFO L226 Difference]: Without dead ends: 51 [2022-11-22 01:29:57,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:29:57,213 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:57,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 10 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:29:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-22 01:29:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-22 01:29:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.64) internal successors, (82), 50 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 82 transitions. [2022-11-22 01:29:57,218 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 82 transitions. Word has length 18 [2022-11-22 01:29:57,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:57,219 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 82 transitions. [2022-11-22 01:29:57,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 82 transitions. [2022-11-22 01:29:57,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 01:29:57,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:57,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:57,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:57,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:57,434 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:57,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:57,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1507545289, now seen corresponding path program 1 times [2022-11-22 01:29:57,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:29:57,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614806826] [2022-11-22 01:29:57,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:29:57,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 01:29:57,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:29:57,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:57,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:29:57,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:29:57,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:29:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:29:57,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:29:57,796 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:29:57,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614806826] [2022-11-22 01:29:57,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614806826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:57,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:57,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:29:57,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549272697] [2022-11-22 01:29:57,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:57,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:29:57,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:29:57,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:29:57,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:29:57,804 INFO L87 Difference]: Start difference. First operand 51 states and 82 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:57,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:57,926 INFO L93 Difference]: Finished difference Result 74 states and 116 transitions. [2022-11-22 01:29:57,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:29:57,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-22 01:29:57,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:57,927 INFO L225 Difference]: With dead ends: 74 [2022-11-22 01:29:57,927 INFO L226 Difference]: Without dead ends: 35 [2022-11-22 01:29:57,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-22 01:29:57,928 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:57,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:29:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-22 01:29:57,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-22 01:29:57,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:57,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2022-11-22 01:29:57,931 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 18 [2022-11-22 01:29:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:57,932 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2022-11-22 01:29:57,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:57,932 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2022-11-22 01:29:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 01:29:57,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:57,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:57,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:58,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:58,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:58,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:58,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1502070231, now seen corresponding path program 2 times [2022-11-22 01:29:58,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:29:58,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435749636] [2022-11-22 01:29:58,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 01:29:58,148 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-22 01:29:58,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:29:58,152 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:58,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:58,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-22 01:29:58,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:29:58,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:29:58,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:29:58,615 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-22 01:29:58,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:29:58,616 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:29:58,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435749636] [2022-11-22 01:29:58,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435749636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:58,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:58,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:29:58,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069927557] [2022-11-22 01:29:58,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:58,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:29:58,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:29:58,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:29:58,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:29:58,620 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:58,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:58,755 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-11-22 01:29:58,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:29:58,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-22 01:29:58,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:58,756 INFO L225 Difference]: With dead ends: 50 [2022-11-22 01:29:58,756 INFO L226 Difference]: Without dead ends: 27 [2022-11-22 01:29:58,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:29:58,757 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:58,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 11 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:29:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-22 01:29:58,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-22 01:29:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-11-22 01:29:58,760 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 18 [2022-11-22 01:29:58,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:58,761 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-11-22 01:29:58,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:58,761 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-11-22 01:29:58,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 01:29:58,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:58,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:58,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:58,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:58,963 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:58,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:58,963 INFO L85 PathProgramCache]: Analyzing trace with hash 704064875, now seen corresponding path program 3 times [2022-11-22 01:29:58,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:29:58,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756970319] [2022-11-22 01:29:58,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:29:58,964 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-22 01:29:58,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:29:58,966 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:59,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:59,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 01:29:59,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:29:59,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-22 01:29:59,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:29:59,441 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-22 01:29:59,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:29:59,442 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:29:59,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756970319] [2022-11-22 01:29:59,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756970319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:29:59,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:29:59,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 01:29:59,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640860205] [2022-11-22 01:29:59,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:29:59,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 01:29:59,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:29:59,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 01:29:59,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:29:59,445 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:59,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:29:59,636 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-11-22 01:29:59,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:29:59,637 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-22 01:29:59,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:29:59,638 INFO L225 Difference]: With dead ends: 36 [2022-11-22 01:29:59,638 INFO L226 Difference]: Without dead ends: 23 [2022-11-22 01:29:59,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:29:59,639 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:29:59,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 21 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:29:59,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-22 01:29:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-22 01:29:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-11-22 01:29:59,642 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2022-11-22 01:29:59,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:29:59,642 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-11-22 01:29:59,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:29:59,642 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-11-22 01:29:59,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 01:29:59,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:29:59,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:29:59,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:59,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:59,844 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-22 01:29:59,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:29:59,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2060878263, now seen corresponding path program 4 times [2022-11-22 01:29:59,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:29:59,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144271447] [2022-11-22 01:29:59,846 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:29:59,846 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-22 01:29:59,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:29:59,848 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:29:59,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:30:00,020 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:30:00,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-22 01:30:00,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 01:30:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:30:00,172 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-22 01:30:00,173 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 01:30:00,174 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-22 01:30:00,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-22 01:30:00,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-22 01:30:00,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-22 01:30:00,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-22 01:30:00,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-22 01:30:00,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-22 01:30:00,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-22 01:30:00,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-22 01:30:00,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-22 01:30:00,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:30:00,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/mathsat -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-22 01:30:00,396 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-11-22 01:30:00,401 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 01:30:00,401 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:30:00,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:30:00 BasicIcfg [2022-11-22 01:30:00,457 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:30:00,458 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:30:00,458 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:30:00,458 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:30:00,459 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:29:44" (3/4) ... [2022-11-22 01:30:00,462 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-22 01:30:00,462 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:30:00,463 INFO L158 Benchmark]: Toolchain (without parser) took 17905.89ms. Allocated memory was 71.3MB in the beginning and 132.1MB in the end (delta: 60.8MB). Free memory was 46.8MB in the beginning and 87.2MB in the end (delta: -40.4MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-11-22 01:30:00,463 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 71.3MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:30:00,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 889.19ms. Allocated memory is still 71.3MB. Free memory was 46.6MB in the beginning and 43.6MB in the end (delta: 2.9MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2022-11-22 01:30:00,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.33ms. Allocated memory is still 71.3MB. Free memory was 43.6MB in the beginning and 41.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:30:00,465 INFO L158 Benchmark]: Boogie Preprocessor took 40.43ms. Allocated memory is still 71.3MB. Free memory was 41.1MB in the beginning and 39.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:30:00,465 INFO L158 Benchmark]: RCFGBuilder took 1182.68ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 39.1MB in the beginning and 40.2MB in the end (delta: -1.1MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-11-22 01:30:00,466 INFO L158 Benchmark]: TraceAbstraction took 15699.45ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 39.8MB in the beginning and 87.2MB in the end (delta: -47.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:30:00,466 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 132.1MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:30:00,468 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.23ms. Allocated memory is still 71.3MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 889.19ms. Allocated memory is still 71.3MB. Free memory was 46.6MB in the beginning and 43.6MB in the end (delta: 2.9MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.33ms. Allocated memory is still 71.3MB. Free memory was 43.6MB in the beginning and 41.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.43ms. Allocated memory is still 71.3MB. Free memory was 41.1MB in the beginning and 39.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1182.68ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 39.1MB in the beginning and 40.2MB in the end (delta: -1.1MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15699.45ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 39.8MB in the beginning and 87.2MB in the end (delta: -47.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 132.1MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 111 PlacesBefore, 34 PlacesAfterwards, 106 TransitionsBefore, 28 TransitionsAfterwards, 1422 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 4167 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2547, independent: 2391, independent conditional: 0, independent unconditional: 2391, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1104, independent: 1063, independent conditional: 0, independent unconditional: 1063, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1104, independent: 1044, independent conditional: 0, independent unconditional: 1044, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 449, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 416, dependent conditional: 0, dependent unconditional: 416, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2547, independent: 1328, independent conditional: 0, independent unconditional: 1328, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 1104, unknown conditional: 0, unknown unconditional: 1104] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 136, Positive conditional cache size: 0, Positive unconditional cache size: 136, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1587; [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1587, ((void *)0), P0, ((void *)0))=1048576, t1587={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1588; [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1588, ((void *)0), P1, ((void *)0))=1048577, t1587={3:0}, t1588={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L807] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L807] RET 0 assume_abort_if_not(main$tmp_guard0) [L809] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1587={3:0}, t1588={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L831] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 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: 798]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 801]: 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: 803]: 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 5 procedures, 126 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 85 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 377 IncrementalHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 38 mSDtfsCounter, 377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 90 ConstructedInterpolants, 11 QuantifiedInterpolants, 715 SizeOfPredicates, 12 NumberOfNonLiveVariables, 824 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-22 01:30:00,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11d6f72-4057-4337-9584-2550448f1ef8/bin/utaipan-g80aRyZoba/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