./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 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_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW --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 649d1c1aa65cb6010503451d39379fb2c9cafcc7e0f5f23661f58b5d14c46288 --- 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-4e7fbc6 [2022-11-23 15:49:49,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:49:49,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:49:49,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:49:49,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:49:49,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:49:49,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:49:49,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:49:49,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:49:49,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:49:49,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:49:49,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:49:49,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:49:49,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:49:49,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:49:49,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:49:49,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:49:49,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:49:49,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:49:49,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:49:49,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:49:49,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:49:49,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:49:49,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:49:49,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:49:49,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:49:49,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:49:49,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:49:49,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:49:49,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:49:49,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:49:49,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:49:49,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:49:49,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:49:49,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:49:49,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:49:49,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:49:49,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:49:49,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:49:49,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:49:49,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:49:49,120 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 15:49:49,178 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:49:49,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:49:49,180 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:49:49,180 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:49:49,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:49:49,182 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:49:49,182 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:49:49,182 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:49:49,183 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:49:49,183 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:49:49,184 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:49:49,185 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:49:49,185 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:49:49,185 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:49:49,186 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:49:49,186 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:49:49,186 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:49:49,187 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:49:49,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 15:49:49,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 15:49:49,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:49:49,189 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:49:49,189 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 15:49:49,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:49:49,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:49:49,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:49:49,191 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 15:49:49,191 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 15:49:49,192 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 15:49:49,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:49:49,192 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 15:49:49,193 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:49:49,193 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:49:49,193 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:49:49,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:49:49,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:49:49,194 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:49:49,195 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:49:49,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:49:49,195 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:49:49,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:49:49,196 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:49:49,196 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_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/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_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW 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 -> 649d1c1aa65cb6010503451d39379fb2c9cafcc7e0f5f23661f58b5d14c46288 [2022-11-23 15:49:49,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:49:49,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:49:49,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:49:49,558 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:49:49,559 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:49:49,560 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2022-11-23 15:49:52,951 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:49:53,433 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:49:53,435 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2022-11-23 15:49:53,460 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/data/48c7301ba/ca6da217c8bd4688b4503c98afbe905d/FLAG18f313f40 [2022-11-23 15:49:53,483 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/data/48c7301ba/ca6da217c8bd4688b4503c98afbe905d [2022-11-23 15:49:53,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:49:53,491 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:49:53,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:49:53,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:49:53,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:49:53,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:49:53" (1/1) ... [2022-11-23 15:49:53,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@797056ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:53, skipping insertion in model container [2022-11-23 15:49:53,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:49:53" (1/1) ... [2022-11-23 15:49:53,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:49:53,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:49:53,883 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_33b10afd-337a-452b-88ea-698c24d952fe/sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-23 15:49:54,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:49:54,333 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:49:54,350 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_33b10afd-337a-452b-88ea-698c24d952fe/sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-23 15:49:54,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:49:54,471 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:49:54,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54 WrapperNode [2022-11-23 15:49:54,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:49:54,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:49:54,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:49:54,474 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:49:54,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2022-11-23 15:49:54,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2022-11-23 15:49:54,548 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-23 15:49:54,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:49:54,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:49:54,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:49:54,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:49:54,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2022-11-23 15:49:54,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2022-11-23 15:49:54,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2022-11-23 15:49:54,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2022-11-23 15:49:54,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2022-11-23 15:49:54,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2022-11-23 15:49:54,590 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2022-11-23 15:49:54,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2022-11-23 15:49:54,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:49:54,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:49:54,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:49:54,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:49:54,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2022-11-23 15:49:54,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:49:54,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:49:54,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:49:54,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:49:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 15:49:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 15:49:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:49:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 15:49:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 15:49:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 15:49:54,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 15:49:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 15:49:54,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 15:49:54,727 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 15:49:54,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 15:49:54,727 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 15:49:54,728 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 15:49:54,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:49:54,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 15:49:54,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:49:54,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:49:54,730 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 15:49:54,899 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:49:54,901 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:49:55,426 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:49:55,615 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:49:55,615 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 15:49:55,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:55 BoogieIcfgContainer [2022-11-23 15:49:55,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:49:55,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:49:55,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:49:55,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:49:55,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:49:53" (1/3) ... [2022-11-23 15:49:55,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40be3288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:49:55, skipping insertion in model container [2022-11-23 15:49:55,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (2/3) ... [2022-11-23 15:49:55,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40be3288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:49:55, skipping insertion in model container [2022-11-23 15:49:55,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:55" (3/3) ... [2022-11-23 15:49:55,633 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.oepc_pso.oepc_rmo.oepc.i [2022-11-23 15:49:55,678 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:49:55,678 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-23 15:49:55,678 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 15:49:55,742 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 15:49:55,778 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 15:49:55,797 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 146 transitions, 312 flow [2022-11-23 15:49:55,806 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 146 transitions, 312 flow [2022-11-23 15:49:55,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2022-11-23 15:49:55,918 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2022-11-23 15:49:55,919 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 15:49:55,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-23 15:49:55,936 INFO L119 LiptonReduction]: Number of co-enabled transitions 3644 [2022-11-23 15:50:02,457 INFO L134 LiptonReduction]: Checked pairs total: 10022 [2022-11-23 15:50:02,457 INFO L136 LiptonReduction]: Total number of compositions: 140 [2022-11-23 15:50:02,466 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 44 transitions, 108 flow [2022-11-23 15:50:02,796 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5498 states, 5479 states have (on average 4.097280525643366) internal successors, (22449), 5497 states have internal predecessors, (22449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:02,815 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:50:02,821 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;@28acdce6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:50:02,821 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-23 15:50:02,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 5498 states, 5479 states have (on average 4.097280525643366) internal successors, (22449), 5497 states have internal predecessors, (22449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:02,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 15:50:02,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:02,844 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 15:50:02,845 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:02,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:02,850 INFO L85 PathProgramCache]: Analyzing trace with hash 616, now seen corresponding path program 1 times [2022-11-23 15:50:02,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:02,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125201414] [2022-11-23 15:50:02,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:02,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:02,975 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-23 15:50:02,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:02,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125201414] [2022-11-23 15:50:02,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125201414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:02,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:02,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 15:50:02,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330420698] [2022-11-23 15:50:02,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:02,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 15:50:02,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:03,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 15:50:03,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 15:50:03,025 INFO L87 Difference]: Start difference. First operand has 5498 states, 5479 states have (on average 4.097280525643366) internal successors, (22449), 5497 states have internal predecessors, (22449), 0 states have call successors, (0), 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-23 15:50:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:03,213 INFO L93 Difference]: Finished difference Result 5124 states and 20487 transitions. [2022-11-23 15:50:03,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 15:50:03,215 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-23 15:50:03,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:03,287 INFO L225 Difference]: With dead ends: 5124 [2022-11-23 15:50:03,288 INFO L226 Difference]: Without dead ends: 5124 [2022-11-23 15:50:03,289 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-23 15:50:03,295 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 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-23 15:50:03,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:50:03,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5124 states. [2022-11-23 15:50:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5124 to 5124. [2022-11-23 15:50:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5124 states, 5119 states have (on average 4.002148857198671) internal successors, (20487), 5123 states have internal predecessors, (20487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 20487 transitions. [2022-11-23 15:50:03,693 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 20487 transitions. Word has length 1 [2022-11-23 15:50:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:03,693 INFO L495 AbstractCegarLoop]: Abstraction has 5124 states and 20487 transitions. [2022-11-23 15:50:03,693 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-23 15:50:03,694 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 20487 transitions. [2022-11-23 15:50:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 15:50:03,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:03,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 15:50:03,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 15:50:03,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:03,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:03,696 INFO L85 PathProgramCache]: Analyzing trace with hash 608068, now seen corresponding path program 1 times [2022-11-23 15:50:03,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:03,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394704447] [2022-11-23 15:50:03,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:03,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:04,059 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-23 15:50:04,059 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:04,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394704447] [2022-11-23 15:50:04,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394704447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:04,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:04,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:50:04,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760263427] [2022-11-23 15:50:04,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:04,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:50:04,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:04,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:50:04,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:50:04,063 INFO L87 Difference]: Start difference. First operand 5124 states and 20487 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:04,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:04,239 INFO L93 Difference]: Finished difference Result 4187 states and 16550 transitions. [2022-11-23 15:50:04,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:50:04,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 15:50:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:04,273 INFO L225 Difference]: With dead ends: 4187 [2022-11-23 15:50:04,274 INFO L226 Difference]: Without dead ends: 4062 [2022-11-23 15:50:04,274 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-23 15:50:04,275 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:04,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 6 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:50:04,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2022-11-23 15:50:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2022-11-23 15:50:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4060 states have (on average 3.9716748768472905) internal successors, (16125), 4061 states have internal predecessors, (16125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2022-11-23 15:50:04,516 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 3 [2022-11-23 15:50:04,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:04,517 INFO L495 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2022-11-23 15:50:04,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2022-11-23 15:50:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 15:50:04,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:04,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:04,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 15:50:04,550 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:04,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:04,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1964527487, now seen corresponding path program 1 times [2022-11-23 15:50:04,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:04,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029936012] [2022-11-23 15:50:04,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:04,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:05,689 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-23 15:50:05,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:05,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029936012] [2022-11-23 15:50:05,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029936012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:05,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:05,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:50:05,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181800564] [2022-11-23 15:50:05,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:05,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:50:05,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:05,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:50:05,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:50:05,697 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-23 15:50:06,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:06,089 INFO L93 Difference]: Finished difference Result 3437 states and 13500 transitions. [2022-11-23 15:50:06,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:50:06,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-23 15:50:06,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:06,140 INFO L225 Difference]: With dead ends: 3437 [2022-11-23 15:50:06,140 INFO L226 Difference]: Without dead ends: 3437 [2022-11-23 15:50:06,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:50:06,142 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:06,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 36 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:50:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2022-11-23 15:50:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3437. [2022-11-23 15:50:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3437 states, 3436 states have (on average 3.928987194412107) internal successors, (13500), 3436 states have internal predecessors, (13500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 13500 transitions. [2022-11-23 15:50:06,294 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 13500 transitions. Word has length 12 [2022-11-23 15:50:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:06,295 INFO L495 AbstractCegarLoop]: Abstraction has 3437 states and 13500 transitions. [2022-11-23 15:50:06,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-23 15:50:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 13500 transitions. [2022-11-23 15:50:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 15:50:06,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:06,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:06,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 15:50:06,306 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:06,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:06,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1964527513, now seen corresponding path program 1 times [2022-11-23 15:50:06,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:06,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758494493] [2022-11-23 15:50:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:06,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:06,596 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-23 15:50:06,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:06,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758494493] [2022-11-23 15:50:06,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758494493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:06,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:06,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:50:06,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385020663] [2022-11-23 15:50:06,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:06,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:50:06,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:06,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:50:06,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:50:06,599 INFO L87 Difference]: Start difference. First operand 3437 states and 13500 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:06,809 INFO L93 Difference]: Finished difference Result 3962 states and 15090 transitions. [2022-11-23 15:50:06,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:50:06,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 15:50:06,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:06,832 INFO L225 Difference]: With dead ends: 3962 [2022-11-23 15:50:06,832 INFO L226 Difference]: Without dead ends: 3337 [2022-11-23 15:50:06,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:50:06,834 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:06,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 13 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:50:06,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2022-11-23 15:50:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 3337. [2022-11-23 15:50:06,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3336 states have (on average 3.908872901678657) internal successors, (13040), 3336 states have internal predecessors, (13040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 13040 transitions. [2022-11-23 15:50:07,055 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 13040 transitions. Word has length 12 [2022-11-23 15:50:07,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:07,059 INFO L495 AbstractCegarLoop]: Abstraction has 3337 states and 13040 transitions. [2022-11-23 15:50:07,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:07,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 13040 transitions. [2022-11-23 15:50:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:50:07,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:07,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:07,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 15:50:07,063 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:07,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:07,071 INFO L85 PathProgramCache]: Analyzing trace with hash -816462755, now seen corresponding path program 1 times [2022-11-23 15:50:07,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:07,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666801083] [2022-11-23 15:50:07,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:07,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:07,299 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-23 15:50:07,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:07,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666801083] [2022-11-23 15:50:07,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666801083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:07,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:07,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:50:07,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375127733] [2022-11-23 15:50:07,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:07,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:50:07,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:07,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:50:07,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:50:07,303 INFO L87 Difference]: Start difference. First operand 3337 states and 13040 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:07,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:07,706 INFO L93 Difference]: Finished difference Result 6616 states and 25029 transitions. [2022-11-23 15:50:07,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:50:07,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 15:50:07,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:07,742 INFO L225 Difference]: With dead ends: 6616 [2022-11-23 15:50:07,743 INFO L226 Difference]: Without dead ends: 4895 [2022-11-23 15:50:07,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:50:07,744 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 72 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:07,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 18 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:50:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4895 states. [2022-11-23 15:50:07,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4895 to 3932. [2022-11-23 15:50:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3932 states, 3931 states have (on average 3.7527346731111675) internal successors, (14752), 3931 states have internal predecessors, (14752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:08,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3932 states to 3932 states and 14752 transitions. [2022-11-23 15:50:08,034 INFO L78 Accepts]: Start accepts. Automaton has 3932 states and 14752 transitions. Word has length 13 [2022-11-23 15:50:08,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:08,035 INFO L495 AbstractCegarLoop]: Abstraction has 3932 states and 14752 transitions. [2022-11-23 15:50:08,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:08,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3932 states and 14752 transitions. [2022-11-23 15:50:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 15:50:08,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:08,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:08,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 15:50:08,040 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:08,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:08,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1923490413, now seen corresponding path program 1 times [2022-11-23 15:50:08,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:08,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730736112] [2022-11-23 15:50:08,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:08,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:08,291 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-23 15:50:08,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:08,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730736112] [2022-11-23 15:50:08,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730736112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:08,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:08,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:50:08,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375340131] [2022-11-23 15:50:08,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:08,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:50:08,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:08,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:50:08,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:50:08,295 INFO L87 Difference]: Start difference. First operand 3932 states and 14752 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:08,495 INFO L93 Difference]: Finished difference Result 4268 states and 15736 transitions. [2022-11-23 15:50:08,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:50:08,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 15:50:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:08,519 INFO L225 Difference]: With dead ends: 4268 [2022-11-23 15:50:08,519 INFO L226 Difference]: Without dead ends: 3868 [2022-11-23 15:50:08,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:50:08,521 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:08,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 13 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:50:08,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2022-11-23 15:50:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3796. [2022-11-23 15:50:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3796 states, 3795 states have (on average 3.7338603425559946) internal successors, (14170), 3795 states have internal predecessors, (14170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 14170 transitions. [2022-11-23 15:50:08,737 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 14170 transitions. Word has length 14 [2022-11-23 15:50:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:08,738 INFO L495 AbstractCegarLoop]: Abstraction has 3796 states and 14170 transitions. [2022-11-23 15:50:08,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 14170 transitions. [2022-11-23 15:50:08,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 15:50:08,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:08,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:08,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 15:50:08,744 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:08,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:08,744 INFO L85 PathProgramCache]: Analyzing trace with hash 200458526, now seen corresponding path program 1 times [2022-11-23 15:50:08,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:08,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137367600] [2022-11-23 15:50:08,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:08,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:08,919 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-23 15:50:08,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:08,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137367600] [2022-11-23 15:50:08,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137367600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:08,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:08,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:50:08,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199273598] [2022-11-23 15:50:08,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:08,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:50:08,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:08,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:50:08,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:50:08,921 INFO L87 Difference]: Start difference. First operand 3796 states and 14170 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:09,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:09,251 INFO L93 Difference]: Finished difference Result 6955 states and 25111 transitions. [2022-11-23 15:50:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:50:09,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-23 15:50:09,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:09,279 INFO L225 Difference]: With dead ends: 6955 [2022-11-23 15:50:09,280 INFO L226 Difference]: Without dead ends: 5044 [2022-11-23 15:50:09,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:50:09,282 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 64 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:09,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 24 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:50:09,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5044 states. [2022-11-23 15:50:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5044 to 3478. [2022-11-23 15:50:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 3477 states have (on average 3.623238423928674) internal successors, (12598), 3477 states have internal predecessors, (12598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 12598 transitions. [2022-11-23 15:50:09,490 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 12598 transitions. Word has length 15 [2022-11-23 15:50:09,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:09,491 INFO L495 AbstractCegarLoop]: Abstraction has 3478 states and 12598 transitions. [2022-11-23 15:50:09,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 12598 transitions. [2022-11-23 15:50:09,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 15:50:09,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:09,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:09,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 15:50:09,500 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:09,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:09,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1082210505, now seen corresponding path program 1 times [2022-11-23 15:50:09,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:09,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698554986] [2022-11-23 15:50:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:09,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:09,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-23 15:50:09,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:09,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698554986] [2022-11-23 15:50:09,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698554986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:09,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:09,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:50:09,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97376997] [2022-11-23 15:50:09,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:09,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:50:09,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:09,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:50:09,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:50:09,750 INFO L87 Difference]: Start difference. First operand 3478 states and 12598 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:09,927 INFO L93 Difference]: Finished difference Result 3298 states and 10663 transitions. [2022-11-23 15:50:09,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:50:09,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-23 15:50:09,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:09,944 INFO L225 Difference]: With dead ends: 3298 [2022-11-23 15:50:09,944 INFO L226 Difference]: Without dead ends: 2538 [2022-11-23 15:50:09,944 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-23 15:50:09,947 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 42 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:09,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 15 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:50:09,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-11-23 15:50:10,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-11-23 15:50:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2537 states have (on average 3.214032321639732) internal successors, (8154), 2537 states have internal predecessors, (8154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 8154 transitions. [2022-11-23 15:50:10,038 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 8154 transitions. Word has length 15 [2022-11-23 15:50:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:10,039 INFO L495 AbstractCegarLoop]: Abstraction has 2538 states and 8154 transitions. [2022-11-23 15:50:10,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 8154 transitions. [2022-11-23 15:50:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 15:50:10,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:10,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:10,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 15:50:10,088 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:10,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:10,089 INFO L85 PathProgramCache]: Analyzing trace with hash 181438902, now seen corresponding path program 1 times [2022-11-23 15:50:10,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:10,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595177071] [2022-11-23 15:50:10,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:10,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:10,370 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-23 15:50:10,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:10,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595177071] [2022-11-23 15:50:10,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595177071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:10,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:10,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:50:10,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579232732] [2022-11-23 15:50:10,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:10,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:50:10,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:10,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:50:10,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:50:10,375 INFO L87 Difference]: Start difference. First operand 2538 states and 8154 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-23 15:50:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:10,802 INFO L93 Difference]: Finished difference Result 4549 states and 14191 transitions. [2022-11-23 15:50:10,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:50:10,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-23 15:50:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:10,823 INFO L225 Difference]: With dead ends: 4549 [2022-11-23 15:50:10,824 INFO L226 Difference]: Without dead ends: 3332 [2022-11-23 15:50:10,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:50:10,826 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 61 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:10,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 22 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:50:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2022-11-23 15:50:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 2375. [2022-11-23 15:50:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2374 states have (on average 3.1752316764953665) internal successors, (7538), 2374 states have internal predecessors, (7538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 7538 transitions. [2022-11-23 15:50:10,966 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 7538 transitions. Word has length 17 [2022-11-23 15:50:10,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:10,966 INFO L495 AbstractCegarLoop]: Abstraction has 2375 states and 7538 transitions. [2022-11-23 15:50:10,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-23 15:50:10,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 7538 transitions. [2022-11-23 15:50:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 15:50:10,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:10,975 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-23 15:50:10,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 15:50:10,975 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:10,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:10,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2017823545, now seen corresponding path program 1 times [2022-11-23 15:50:10,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:10,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047053947] [2022-11-23 15:50:10,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:10,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:11,302 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-23 15:50:11,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:11,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047053947] [2022-11-23 15:50:11,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047053947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:11,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:11,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:50:11,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317674516] [2022-11-23 15:50:11,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:11,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:50:11,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:11,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:50:11,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:50:11,312 INFO L87 Difference]: Start difference. First operand 2375 states and 7538 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-23 15:50:11,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:11,600 INFO L93 Difference]: Finished difference Result 3677 states and 11372 transitions. [2022-11-23 15:50:11,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:50:11,602 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-23 15:50:11,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:11,617 INFO L225 Difference]: With dead ends: 3677 [2022-11-23 15:50:11,617 INFO L226 Difference]: Without dead ends: 2429 [2022-11-23 15:50:11,618 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-23 15:50:11,619 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 40 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:11,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 16 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:50:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2022-11-23 15:50:11,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2099. [2022-11-23 15:50:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 2098 states have (on average 3.0991420400381315) internal successors, (6502), 2098 states have internal predecessors, (6502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 6502 transitions. [2022-11-23 15:50:11,724 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 6502 transitions. Word has length 18 [2022-11-23 15:50:11,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:11,725 INFO L495 AbstractCegarLoop]: Abstraction has 2099 states and 6502 transitions. [2022-11-23 15:50:11,725 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-23 15:50:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 6502 transitions. [2022-11-23 15:50:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 15:50:11,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:11,732 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-23 15:50:11,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 15:50:11,732 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:11,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:11,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1736751340, now seen corresponding path program 1 times [2022-11-23 15:50:11,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:11,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066368218] [2022-11-23 15:50:11,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:11,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:12,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:50:12,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:12,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066368218] [2022-11-23 15:50:12,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066368218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:12,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:12,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:50:12,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215991063] [2022-11-23 15:50:12,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:12,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:50:12,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:12,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:50:12,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:50:12,034 INFO L87 Difference]: Start difference. First operand 2099 states and 6502 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:12,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:12,309 INFO L93 Difference]: Finished difference Result 1686 states and 4690 transitions. [2022-11-23 15:50:12,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:50:12,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 15:50:12,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:12,315 INFO L225 Difference]: With dead ends: 1686 [2022-11-23 15:50:12,315 INFO L226 Difference]: Without dead ends: 1309 [2022-11-23 15:50:12,316 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-23 15:50:12,316 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 72 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:12,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 21 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:50:12,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2022-11-23 15:50:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1309. [2022-11-23 15:50:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1309 states, 1308 states have (on average 2.741590214067278) internal successors, (3586), 1308 states have internal predecessors, (3586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 3586 transitions. [2022-11-23 15:50:12,358 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 3586 transitions. Word has length 18 [2022-11-23 15:50:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:12,358 INFO L495 AbstractCegarLoop]: Abstraction has 1309 states and 3586 transitions. [2022-11-23 15:50:12,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 3586 transitions. [2022-11-23 15:50:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 15:50:12,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:12,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:12,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 15:50:12,364 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:12,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:12,364 INFO L85 PathProgramCache]: Analyzing trace with hash -881044151, now seen corresponding path program 1 times [2022-11-23 15:50:12,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:12,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280892542] [2022-11-23 15:50:12,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:12,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:12,641 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-23 15:50:12,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:12,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280892542] [2022-11-23 15:50:12,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280892542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:12,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:12,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:50:12,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756655989] [2022-11-23 15:50:12,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:12,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:50:12,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:12,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:50:12,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:50:12,645 INFO L87 Difference]: Start difference. First operand 1309 states and 3586 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:12,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:12,965 INFO L93 Difference]: Finished difference Result 1104 states and 2966 transitions. [2022-11-23 15:50:12,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:50:12,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-23 15:50:12,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:12,969 INFO L225 Difference]: With dead ends: 1104 [2022-11-23 15:50:12,970 INFO L226 Difference]: Without dead ends: 855 [2022-11-23 15:50:12,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:50:12,971 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 93 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:12,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 21 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:50:12,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-11-23 15:50:12,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2022-11-23 15:50:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 854 states have (on average 2.6814988290398127) internal successors, (2290), 854 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 2290 transitions. [2022-11-23 15:50:13,000 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 2290 transitions. Word has length 21 [2022-11-23 15:50:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:13,001 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 2290 transitions. [2022-11-23 15:50:13,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 2290 transitions. [2022-11-23 15:50:13,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 15:50:13,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:13,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:13,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 15:50:13,005 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:13,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:13,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1771936697, now seen corresponding path program 1 times [2022-11-23 15:50:13,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:13,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2705236] [2022-11-23 15:50:13,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:13,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:13,402 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-23 15:50:13,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:13,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2705236] [2022-11-23 15:50:13,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2705236] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:13,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:13,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 15:50:13,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764987394] [2022-11-23 15:50:13,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:13,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:50:13,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:13,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:50:13,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:50:13,406 INFO L87 Difference]: Start difference. First operand 855 states and 2290 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:13,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:13,668 INFO L93 Difference]: Finished difference Result 814 states and 2209 transitions. [2022-11-23 15:50:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:50:13,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-23 15:50:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:13,670 INFO L225 Difference]: With dead ends: 814 [2022-11-23 15:50:13,670 INFO L226 Difference]: Without dead ends: 317 [2022-11-23 15:50:13,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:50:13,671 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 151 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:13,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 12 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:50:13,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-23 15:50:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2022-11-23 15:50:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 2.721518987341772) internal successors, (860), 316 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 860 transitions. [2022-11-23 15:50:13,681 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 860 transitions. Word has length 24 [2022-11-23 15:50:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:13,682 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 860 transitions. [2022-11-23 15:50:13,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 860 transitions. [2022-11-23 15:50:13,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 15:50:13,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:13,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:13,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 15:50:13,684 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:13,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:13,685 INFO L85 PathProgramCache]: Analyzing trace with hash -434110713, now seen corresponding path program 1 times [2022-11-23 15:50:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:13,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325203717] [2022-11-23 15:50:13,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:13,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:15,616 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-23 15:50:15,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:15,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325203717] [2022-11-23 15:50:15,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325203717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:15,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:15,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 15:50:15,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591643162] [2022-11-23 15:50:15,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:15,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 15:50:15,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:15,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 15:50:15,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-23 15:50:15,618 INFO L87 Difference]: Start difference. First operand 317 states and 860 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:16,120 INFO L93 Difference]: Finished difference Result 568 states and 1490 transitions. [2022-11-23 15:50:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 15:50:16,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-23 15:50:16,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:16,122 INFO L225 Difference]: With dead ends: 568 [2022-11-23 15:50:16,123 INFO L226 Difference]: Without dead ends: 430 [2022-11-23 15:50:16,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-23 15:50:16,123 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 106 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:16,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 20 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 15:50:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-11-23 15:50:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 381. [2022-11-23 15:50:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 2.6578947368421053) internal successors, (1010), 380 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1010 transitions. [2022-11-23 15:50:16,135 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1010 transitions. Word has length 28 [2022-11-23 15:50:16,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:16,135 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 1010 transitions. [2022-11-23 15:50:16,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:16,135 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1010 transitions. [2022-11-23 15:50:16,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 15:50:16,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:16,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:16,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 15:50:16,140 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:16,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:16,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1881631481, now seen corresponding path program 2 times [2022-11-23 15:50:16,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:16,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022715254] [2022-11-23 15:50:16,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:16,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:50:16,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 15:50:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:50:16,302 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 15:50:16,302 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 15:50:16,303 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-23 15:50:16,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-23 15:50:16,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-23 15:50:16,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-23 15:50:16,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-23 15:50:16,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-23 15:50:16,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-23 15:50:16,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-23 15:50:16,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-23 15:50:16,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-23 15:50:16,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-23 15:50:16,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-23 15:50:16,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-23 15:50:16,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-23 15:50:16,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-23 15:50:16,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-23 15:50:16,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 15:50:16,311 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:16,316 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 15:50:16,317 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:50:16,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:50:16 BasicIcfg [2022-11-23 15:50:16,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:50:16,427 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:50:16,428 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:50:16,428 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:50:16,428 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:55" (3/4) ... [2022-11-23 15:50:16,431 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 15:50:16,432 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:50:16,432 INFO L158 Benchmark]: Toolchain (without parser) took 22941.65ms. Allocated memory was 157.3MB in the beginning and 866.1MB in the end (delta: 708.8MB). Free memory was 123.5MB in the beginning and 562.9MB in the end (delta: -439.4MB). Peak memory consumption was 272.6MB. Max. memory is 16.1GB. [2022-11-23 15:50:16,433 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 121.6MB. Free memory was 64.1MB in the beginning and 64.0MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:50:16,434 INFO L158 Benchmark]: CACSL2BoogieTranslator took 977.09ms. Allocated memory is still 157.3MB. Free memory was 122.8MB in the beginning and 99.0MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 15:50:16,434 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.48ms. Allocated memory is still 157.3MB. Free memory was 99.0MB in the beginning and 96.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:50:16,435 INFO L158 Benchmark]: Boogie Preprocessor took 46.72ms. Allocated memory is still 157.3MB. Free memory was 96.8MB in the beginning and 94.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:50:16,435 INFO L158 Benchmark]: RCFGBuilder took 1022.95ms. Allocated memory is still 157.3MB. Free memory was 94.8MB in the beginning and 124.2MB in the end (delta: -29.3MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2022-11-23 15:50:16,436 INFO L158 Benchmark]: TraceAbstraction took 20803.72ms. Allocated memory was 157.3MB in the beginning and 866.1MB in the end (delta: 708.8MB). Free memory was 123.5MB in the beginning and 562.9MB in the end (delta: -439.4MB). Peak memory consumption was 269.6MB. Max. memory is 16.1GB. [2022-11-23 15:50:16,436 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 866.1MB. Free memory is still 562.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:50:16,439 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 121.6MB. Free memory was 64.1MB in the beginning and 64.0MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 977.09ms. Allocated memory is still 157.3MB. Free memory was 122.8MB in the beginning and 99.0MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.48ms. Allocated memory is still 157.3MB. Free memory was 99.0MB in the beginning and 96.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.72ms. Allocated memory is still 157.3MB. Free memory was 96.8MB in the beginning and 94.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1022.95ms. Allocated memory is still 157.3MB. Free memory was 94.8MB in the beginning and 124.2MB in the end (delta: -29.3MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20803.72ms. Allocated memory was 157.3MB in the beginning and 866.1MB in the end (delta: 708.8MB). Free memory was 123.5MB in the beginning and 562.9MB in the end (delta: -439.4MB). Peak memory consumption was 269.6MB. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 866.1MB. Free memory is still 562.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 157 PlacesBefore, 56 PlacesAfterwards, 146 TransitionsBefore, 44 TransitionsAfterwards, 3644 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 140 TotalNumberOfCompositions, 10022 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6188, independent: 5971, independent conditional: 0, independent unconditional: 5971, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2714, independent: 2652, independent conditional: 0, independent unconditional: 2652, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2714, independent: 2619, independent conditional: 0, independent unconditional: 2619, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 545, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 488, dependent conditional: 0, dependent unconditional: 488, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6188, independent: 3319, independent conditional: 0, independent unconditional: 3319, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 2714, unknown conditional: 0, unknown unconditional: 2714] , Statistics on independence cache: Total cache size (in pairs): 388, Positive cache size: 364, Positive conditional cache size: 0, Positive unconditional cache size: 364, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool a$flush_delayed; [L716] 0 int a$mem_tmp; [L717] 0 _Bool a$r_buff0_thd0; [L718] 0 _Bool a$r_buff0_thd1; [L719] 0 _Bool a$r_buff0_thd2; [L720] 0 _Bool a$r_buff0_thd3; [L721] 0 _Bool a$r_buff0_thd4; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1513; [L858] FCALL, FORK 0 pthread_create(&t1513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1513, ((void *)0), P0, ((void *)0))=-3, t1513={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L755] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t1514; [L860] FCALL, FORK 0 pthread_create(&t1514, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1514, ((void *)0), P1, ((void *)0))=-2, t1513={5:0}, t1514={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1515; [L862] FCALL, FORK 0 pthread_create(&t1515, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1515, ((void *)0), P2, ((void *)0))=-1, t1513={5:0}, t1514={6:0}, t1515={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1516; [L759] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L796] 3 y = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L799] 3 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L802] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L803] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L804] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L805] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L806] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L864] FCALL, FORK 0 pthread_create(&t1516, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1516, ((void *)0), P3, ((void *)0))=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L816] 4 z = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L819] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 4 a$flush_delayed = weak$$choice2 [L822] 4 a$mem_tmp = a [L823] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L824] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L825] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L826] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L827] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L829] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 __unbuffered_p3_EAX = a [L831] 4 a = a$flush_delayed ? a$mem_tmp : a [L832] 4 a$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L835] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L836] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L837] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L838] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L839] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L842] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 4 return 0; [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L871] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L872] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L873] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L874] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 862]: 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 9 procedures, 182 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 20.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 829 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 829 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1817 IncrementalHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 86 mSDtfsCounter, 1817 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5498occurred in iteration=0, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 3937 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 2071 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-23 15:50:16,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/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_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW --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 649d1c1aa65cb6010503451d39379fb2c9cafcc7e0f5f23661f58b5d14c46288 --- 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-4e7fbc6 [2022-11-23 15:50:19,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:50:19,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:50:19,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:50:19,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:50:19,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:50:19,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:50:19,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:50:19,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:50:19,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:50:19,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:50:19,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:50:19,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:50:19,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:50:19,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:50:19,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:50:19,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:50:19,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:50:19,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:50:19,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:50:19,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:50:19,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:50:19,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:50:19,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:50:19,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:50:19,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:50:19,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:50:19,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:50:19,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:50:19,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:50:19,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:50:19,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:50:19,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:50:19,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:50:19,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:50:19,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:50:19,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:50:19,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:50:19,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:50:19,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:50:19,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:50:19,243 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-23 15:50:19,297 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:50:19,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:50:19,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:50:19,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:50:19,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:50:19,306 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:50:19,307 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:50:19,307 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:50:19,308 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:50:19,308 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:50:19,309 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:50:19,310 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:50:19,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 15:50:19,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 15:50:19,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:50:19,313 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:50:19,313 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 15:50:19,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:50:19,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:50:19,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:50:19,314 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 15:50:19,315 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 15:50:19,315 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 15:50:19,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:50:19,316 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 15:50:19,316 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 15:50:19,317 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 15:50:19,317 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:50:19,317 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:50:19,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:50:19,318 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 15:50:19,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:50:19,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:50:19,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:50:19,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:50:19,321 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 15:50:19,321 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 15:50:19,321 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:50:19,322 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 15:50:19,322 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_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/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_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW 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 -> 649d1c1aa65cb6010503451d39379fb2c9cafcc7e0f5f23661f58b5d14c46288 [2022-11-23 15:50:19,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:50:19,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:50:19,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:50:19,791 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:50:19,791 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:50:19,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2022-11-23 15:50:22,981 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:50:23,352 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:50:23,353 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2022-11-23 15:50:23,367 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/data/0ff4ec6b4/8e53759243ff45b49d22da74ccae8b76/FLAG9cb13be0d [2022-11-23 15:50:23,385 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/data/0ff4ec6b4/8e53759243ff45b49d22da74ccae8b76 [2022-11-23 15:50:23,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:50:23,390 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:50:23,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:50:23,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:50:23,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:50:23,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:50:23" (1/1) ... [2022-11-23 15:50:23,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ffb7d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:23, skipping insertion in model container [2022-11-23 15:50:23,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:50:23" (1/1) ... [2022-11-23 15:50:23,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:50:23,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:50:23,673 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_33b10afd-337a-452b-88ea-698c24d952fe/sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-23 15:50:23,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:50:23,961 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:50:23,977 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_33b10afd-337a-452b-88ea-698c24d952fe/sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-23 15:50:24,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:50:24,127 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:50:24,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:24 WrapperNode [2022-11-23 15:50:24,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:50:24,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:50:24,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:50:24,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:50:24,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:24" (1/1) ... [2022-11-23 15:50:24,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:24" (1/1) ... [2022-11-23 15:50:24,229 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-23 15:50:24,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:50:24,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:50:24,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:50:24,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:50:24,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:24" (1/1) ... [2022-11-23 15:50:24,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:24" (1/1) ... [2022-11-23 15:50:24,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:24" (1/1) ... [2022-11-23 15:50:24,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:24" (1/1) ... [2022-11-23 15:50:24,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:24" (1/1) ... [2022-11-23 15:50:24,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:24" (1/1) ... [2022-11-23 15:50:24,307 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:24" (1/1) ... [2022-11-23 15:50:24,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:24" (1/1) ... [2022-11-23 15:50:24,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:50:24,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:50:24,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:50:24,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:50:24,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:24" (1/1) ... [2022-11-23 15:50:24,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:50:24,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:50:24,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:50:24,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:50:24,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 15:50:24,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:50:24,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 15:50:24,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 15:50:24,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 15:50:24,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 15:50:24,444 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 15:50:24,444 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 15:50:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 15:50:24,445 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 15:50:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 15:50:24,445 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 15:50:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 15:50:24,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 15:50:24,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 15:50:24,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:50:24,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:50:24,448 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 15:50:24,697 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:50:24,700 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:50:25,320 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:50:25,506 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:50:25,506 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 15:50:25,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:50:25 BoogieIcfgContainer [2022-11-23 15:50:25,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:50:25,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:50:25,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:50:25,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:50:25,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:50:23" (1/3) ... [2022-11-23 15:50:25,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557c8651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:50:25, skipping insertion in model container [2022-11-23 15:50:25,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:24" (2/3) ... [2022-11-23 15:50:25,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557c8651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:50:25, skipping insertion in model container [2022-11-23 15:50:25,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:50:25" (3/3) ... [2022-11-23 15:50:25,526 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.oepc_pso.oepc_rmo.oepc.i [2022-11-23 15:50:25,551 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:50:25,551 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-23 15:50:25,552 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 15:50:25,671 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 15:50:25,719 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 15:50:25,748 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 147 transitions, 314 flow [2022-11-23 15:50:25,759 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 147 transitions, 314 flow [2022-11-23 15:50:25,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 314 flow [2022-11-23 15:50:25,864 INFO L130 PetriNetUnfolder]: 2/143 cut-off events. [2022-11-23 15:50:25,864 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 15:50:25,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 2/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-23 15:50:25,875 INFO L119 LiptonReduction]: Number of co-enabled transitions 3644 [2022-11-23 15:50:36,843 INFO L134 LiptonReduction]: Checked pairs total: 10235 [2022-11-23 15:50:36,843 INFO L136 LiptonReduction]: Total number of compositions: 141 [2022-11-23 15:50:36,851 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 44 transitions, 108 flow [2022-11-23 15:50:37,197 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5498 states, 5479 states have (on average 4.097280525643366) internal successors, (22449), 5497 states have internal predecessors, (22449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:37,224 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:50:37,233 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;@57358d2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:50:37,234 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-23 15:50:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 5498 states, 5479 states have (on average 4.097280525643366) internal successors, (22449), 5497 states have internal predecessors, (22449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:37,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 15:50:37,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:37,262 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 15:50:37,262 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:37,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:37,270 INFO L85 PathProgramCache]: Analyzing trace with hash 619, now seen corresponding path program 1 times [2022-11-23 15:50:37,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:50:37,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254930365] [2022-11-23 15:50:37,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:37,286 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-23 15:50:37,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:50:37,298 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:37,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:37,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 15:50:37,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:50:37,395 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-23 15:50:37,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:50:37,397 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:50:37,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254930365] [2022-11-23 15:50:37,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254930365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:37,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:37,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 15:50:37,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684367830] [2022-11-23 15:50:37,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:37,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 15:50:37,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:50:37,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 15:50:37,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 15:50:37,449 INFO L87 Difference]: Start difference. First operand has 5498 states, 5479 states have (on average 4.097280525643366) internal successors, (22449), 5497 states have internal predecessors, (22449), 0 states have call successors, (0), 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-23 15:50:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:37,847 INFO L93 Difference]: Finished difference Result 5124 states and 20487 transitions. [2022-11-23 15:50:37,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 15:50:37,850 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-23 15:50:37,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:37,968 INFO L225 Difference]: With dead ends: 5124 [2022-11-23 15:50:37,969 INFO L226 Difference]: Without dead ends: 5124 [2022-11-23 15:50:37,969 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-23 15:50:37,973 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 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-23 15:50:37,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:50:38,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5124 states. [2022-11-23 15:50:38,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5124 to 5124. [2022-11-23 15:50:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5124 states, 5119 states have (on average 4.002148857198671) internal successors, (20487), 5123 states have internal predecessors, (20487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 20487 transitions. [2022-11-23 15:50:38,376 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 20487 transitions. Word has length 1 [2022-11-23 15:50:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:38,377 INFO L495 AbstractCegarLoop]: Abstraction has 5124 states and 20487 transitions. [2022-11-23 15:50:38,380 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-23 15:50:38,381 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 20487 transitions. [2022-11-23 15:50:38,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 15:50:38,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:38,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 15:50:38,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-23 15:50:38,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:38,606 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:38,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash 611071, now seen corresponding path program 1 times [2022-11-23 15:50:38,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:50:38,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978535706] [2022-11-23 15:50:38,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:38,610 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-23 15:50:38,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:50:38,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:38,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:38,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 15:50:38,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:50:38,779 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-23 15:50:38,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:50:38,779 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:50:38,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978535706] [2022-11-23 15:50:38,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978535706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:38,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:38,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:50:38,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285849887] [2022-11-23 15:50:38,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:38,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:50:38,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:50:38,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:50:38,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:50:38,783 INFO L87 Difference]: Start difference. First operand 5124 states and 20487 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:39,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:39,130 INFO L93 Difference]: Finished difference Result 4187 states and 16550 transitions. [2022-11-23 15:50:39,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:50:39,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 15:50:39,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:39,177 INFO L225 Difference]: With dead ends: 4187 [2022-11-23 15:50:39,178 INFO L226 Difference]: Without dead ends: 4062 [2022-11-23 15:50:39,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:50:39,179 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:39,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 6 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:50:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2022-11-23 15:50:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2022-11-23 15:50:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4060 states have (on average 3.9716748768472905) internal successors, (16125), 4061 states have internal predecessors, (16125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2022-11-23 15:50:39,597 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 3 [2022-11-23 15:50:39,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:39,597 INFO L495 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2022-11-23 15:50:39,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:39,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2022-11-23 15:50:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 15:50:39,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:39,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:39,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:39,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:39,820 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:39,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:39,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1405124683, now seen corresponding path program 1 times [2022-11-23 15:50:39,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:50:39,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420416838] [2022-11-23 15:50:39,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:39,822 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-23 15:50:39,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:50:39,823 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:39,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:39,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 15:50:39,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:50:40,004 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-23 15:50:40,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:50:40,005 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:50:40,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420416838] [2022-11-23 15:50:40,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420416838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:40,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:40,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:50:40,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088259213] [2022-11-23 15:50:40,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:40,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:50:40,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:50:40,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:50:40,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:50:40,008 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 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-23 15:50:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:40,303 INFO L93 Difference]: Finished difference Result 3407 states and 11981 transitions. [2022-11-23 15:50:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:50:40,304 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-23 15:50:40,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:40,330 INFO L225 Difference]: With dead ends: 3407 [2022-11-23 15:50:40,330 INFO L226 Difference]: Without dead ends: 2782 [2022-11-23 15:50:40,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-23 15:50:40,332 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 45 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:40,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 15 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:50:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2022-11-23 15:50:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2782. [2022-11-23 15:50:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2780 states have (on average 3.4982014388489207) internal successors, (9725), 2781 states have internal predecessors, (9725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 9725 transitions. [2022-11-23 15:50:40,627 INFO L78 Accepts]: Start accepts. Automaton has 2782 states and 9725 transitions. Word has length 12 [2022-11-23 15:50:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:40,629 INFO L495 AbstractCegarLoop]: Abstraction has 2782 states and 9725 transitions. [2022-11-23 15:50:40,629 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-23 15:50:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 9725 transitions. [2022-11-23 15:50:40,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 15:50:40,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:40,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:40,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:40,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:40,850 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:40,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:40,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1108631622, now seen corresponding path program 1 times [2022-11-23 15:50:40,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:50:40,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312056151] [2022-11-23 15:50:40,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:40,855 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-23 15:50:40,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:50:40,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:40,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:41,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:50:41,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:50:41,056 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-23 15:50:41,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:50:41,057 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:50:41,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312056151] [2022-11-23 15:50:41,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312056151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:41,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:41,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:50:41,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866283265] [2022-11-23 15:50:41,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:41,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:50:41,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:50:41,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:50:41,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:50:41,060 INFO L87 Difference]: Start difference. First operand 2782 states and 9725 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:41,380 INFO L93 Difference]: Finished difference Result 1871 states and 5837 transitions. [2022-11-23 15:50:41,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:50:41,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 15:50:41,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:41,391 INFO L225 Difference]: With dead ends: 1871 [2022-11-23 15:50:41,392 INFO L226 Difference]: Without dead ends: 1502 [2022-11-23 15:50:41,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:50:41,393 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 60 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:41,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 27 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:50:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-11-23 15:50:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2022-11-23 15:50:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1500 states have (on average 3.07) internal successors, (4605), 1501 states have internal predecessors, (4605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4605 transitions. [2022-11-23 15:50:41,531 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4605 transitions. Word has length 16 [2022-11-23 15:50:41,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:41,532 INFO L495 AbstractCegarLoop]: Abstraction has 1502 states and 4605 transitions. [2022-11-23 15:50:41,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4605 transitions. [2022-11-23 15:50:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 15:50:41,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:41,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:41,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:41,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:41,749 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:41,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:41,751 INFO L85 PathProgramCache]: Analyzing trace with hash -956918315, now seen corresponding path program 1 times [2022-11-23 15:50:41,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:50:41,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278112758] [2022-11-23 15:50:41,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:41,752 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-23 15:50:41,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:50:41,753 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:41,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:41,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 15:50:41,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:50:41,972 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-23 15:50:41,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:50:41,972 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:50:41,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278112758] [2022-11-23 15:50:41,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278112758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:41,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:41,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:50:41,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000051706] [2022-11-23 15:50:41,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:41,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:50:41,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:50:41,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:50:41,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:50:41,975 INFO L87 Difference]: Start difference. First operand 1502 states and 4605 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:42,408 INFO L93 Difference]: Finished difference Result 1135 states and 3469 transitions. [2022-11-23 15:50:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:50:42,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-23 15:50:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:42,414 INFO L225 Difference]: With dead ends: 1135 [2022-11-23 15:50:42,414 INFO L226 Difference]: Without dead ends: 1022 [2022-11-23 15:50:42,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:50:42,415 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 73 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:42,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 48 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 15:50:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2022-11-23 15:50:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1022. [2022-11-23 15:50:42,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1020 states have (on average 3.1029411764705883) internal successors, (3165), 1021 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:42,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 3165 transitions. [2022-11-23 15:50:42,450 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 3165 transitions. Word has length 20 [2022-11-23 15:50:42,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:42,451 INFO L495 AbstractCegarLoop]: Abstraction has 1022 states and 3165 transitions. [2022-11-23 15:50:42,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 3165 transitions. [2022-11-23 15:50:42,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 15:50:42,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:42,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:42,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:42,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:42,668 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:42,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:42,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2079663907, now seen corresponding path program 1 times [2022-11-23 15:50:42,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:50:42,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458004603] [2022-11-23 15:50:42,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:42,671 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-23 15:50:42,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:50:42,673 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:42,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:42,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 15:50:42,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:50:42,928 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-23 15:50:42,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:50:42,928 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:50:42,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458004603] [2022-11-23 15:50:42,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458004603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:42,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:42,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 15:50:42,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823623992] [2022-11-23 15:50:42,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:42,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:50:42,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:50:42,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:50:42,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:50:42,931 INFO L87 Difference]: Start difference. First operand 1022 states and 3165 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:43,474 INFO L93 Difference]: Finished difference Result 959 states and 3037 transitions. [2022-11-23 15:50:43,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:50:43,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-23 15:50:43,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:43,479 INFO L225 Difference]: With dead ends: 959 [2022-11-23 15:50:43,479 INFO L226 Difference]: Without dead ends: 942 [2022-11-23 15:50:43,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:50:43,480 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 68 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:43,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 72 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 15:50:43,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2022-11-23 15:50:43,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 942. [2022-11-23 15:50:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 940 states have (on average 3.1968085106382977) internal successors, (3005), 941 states have internal predecessors, (3005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 3005 transitions. [2022-11-23 15:50:43,534 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 3005 transitions. Word has length 24 [2022-11-23 15:50:43,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:43,535 INFO L495 AbstractCegarLoop]: Abstraction has 942 states and 3005 transitions. [2022-11-23 15:50:43,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:43,535 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 3005 transitions. [2022-11-23 15:50:43,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 15:50:43,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:43,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:43,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:43,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:43,752 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:43,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:43,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1622309863, now seen corresponding path program 1 times [2022-11-23 15:50:43,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:50:43,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114464152] [2022-11-23 15:50:43,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:43,754 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-23 15:50:43,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:50:43,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:43,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:43,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 15:50:43,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:50:44,337 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-23 15:50:44,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:50:44,338 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:50:44,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114464152] [2022-11-23 15:50:44,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114464152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:44,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:44,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 15:50:44,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367175359] [2022-11-23 15:50:44,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:44,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:50:44,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:50:44,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:50:44,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:50:44,341 INFO L87 Difference]: Start difference. First operand 942 states and 3005 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:44,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:44,845 INFO L93 Difference]: Finished difference Result 1438 states and 4390 transitions. [2022-11-23 15:50:44,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:50:44,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-23 15:50:44,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:44,852 INFO L225 Difference]: With dead ends: 1438 [2022-11-23 15:50:44,852 INFO L226 Difference]: Without dead ends: 1438 [2022-11-23 15:50:44,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-23 15:50:44,854 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 81 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:44,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 38 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 15:50:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2022-11-23 15:50:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1255. [2022-11-23 15:50:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1253 states have (on average 3.122106943335994) internal successors, (3912), 1254 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 3912 transitions. [2022-11-23 15:50:44,912 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 3912 transitions. Word has length 28 [2022-11-23 15:50:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:44,912 INFO L495 AbstractCegarLoop]: Abstraction has 1255 states and 3912 transitions. [2022-11-23 15:50:44,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 3912 transitions. [2022-11-23 15:50:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 15:50:44,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:44,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:44,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:45,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:45,140 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:45,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:45,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1622309882, now seen corresponding path program 1 times [2022-11-23 15:50:45,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:50:45,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189186100] [2022-11-23 15:50:45,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:45,142 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-23 15:50:45,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:50:45,143 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:45,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:45,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 15:50:45,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:50:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:50:46,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:50:46,119 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:50:46,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189186100] [2022-11-23 15:50:46,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189186100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:46,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:46,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:50:46,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241826299] [2022-11-23 15:50:46,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:46,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:50:46,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:50:46,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:50:46,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:50:46,122 INFO L87 Difference]: Start difference. First operand 1255 states and 3912 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:46,676 INFO L93 Difference]: Finished difference Result 1254 states and 3910 transitions. [2022-11-23 15:50:46,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:50:46,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-23 15:50:46,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:46,682 INFO L225 Difference]: With dead ends: 1254 [2022-11-23 15:50:46,683 INFO L226 Difference]: Without dead ends: 1021 [2022-11-23 15:50:46,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:50:46,683 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:46,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 36 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 15:50:46,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2022-11-23 15:50:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1021. [2022-11-23 15:50:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 3.135294117647059) internal successors, (3198), 1020 states have internal predecessors, (3198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:46,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 3198 transitions. [2022-11-23 15:50:46,727 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 3198 transitions. Word has length 28 [2022-11-23 15:50:46,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:46,727 INFO L495 AbstractCegarLoop]: Abstraction has 1021 states and 3198 transitions. [2022-11-23 15:50:46,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 3198 transitions. [2022-11-23 15:50:46,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 15:50:46,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:46,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:46,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:46,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:46,946 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:46,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:46,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1676850103, now seen corresponding path program 2 times [2022-11-23 15:50:46,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:50:46,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291633515] [2022-11-23 15:50:46,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 15:50:46,949 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-23 15:50:46,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:50:46,950 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:46,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:47,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 15:50:47,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:50:47,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 15:50:47,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:50:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:50:47,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:50:47,183 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:50:47,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291633515] [2022-11-23 15:50:47,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291633515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:47,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:47,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:50:47,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546584262] [2022-11-23 15:50:47,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:47,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:50:47,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:50:47,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:50:47,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:50:47,186 INFO L87 Difference]: Start difference. First operand 1021 states and 3198 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:47,371 INFO L93 Difference]: Finished difference Result 1344 states and 4152 transitions. [2022-11-23 15:50:47,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:50:47,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-23 15:50:47,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:47,375 INFO L225 Difference]: With dead ends: 1344 [2022-11-23 15:50:47,376 INFO L226 Difference]: Without dead ends: 821 [2022-11-23 15:50:47,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-23 15:50:47,377 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:47,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:50:47,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-11-23 15:50:47,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2022-11-23 15:50:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 820 states have (on average 3.046341463414634) internal successors, (2498), 820 states have internal predecessors, (2498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2498 transitions. [2022-11-23 15:50:47,411 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2498 transitions. Word has length 28 [2022-11-23 15:50:47,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:47,412 INFO L495 AbstractCegarLoop]: Abstraction has 821 states and 2498 transitions. [2022-11-23 15:50:47,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2498 transitions. [2022-11-23 15:50:47,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 15:50:47,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:47,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:47,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:47,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:47,630 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:47,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:47,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1198429381, now seen corresponding path program 3 times [2022-11-23 15:50:47,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:50:47,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141767914] [2022-11-23 15:50:47,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:50:47,631 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-23 15:50:47,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:50:47,633 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:47,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-23 15:50:47,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 15:50:47,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:50:47,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 15:50:47,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:50:48,391 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-23 15:50:48,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:50:48,392 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:50:48,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141767914] [2022-11-23 15:50:48,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141767914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:50:48,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:50:48,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 15:50:48,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839916252] [2022-11-23 15:50:48,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:48,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 15:50:48,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:50:48,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 15:50:48,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-23 15:50:48,394 INFO L87 Difference]: Start difference. First operand 821 states and 2498 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:48,853 INFO L93 Difference]: Finished difference Result 884 states and 2649 transitions. [2022-11-23 15:50:48,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:50:48,853 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-23 15:50:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:48,857 INFO L225 Difference]: With dead ends: 884 [2022-11-23 15:50:48,857 INFO L226 Difference]: Without dead ends: 617 [2022-11-23 15:50:48,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-23 15:50:48,858 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 77 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:48,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 33 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 15:50:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-11-23 15:50:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 537. [2022-11-23 15:50:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 2.9776119402985075) internal successors, (1596), 536 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1596 transitions. [2022-11-23 15:50:48,884 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1596 transitions. Word has length 28 [2022-11-23 15:50:48,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:48,884 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 1596 transitions. [2022-11-23 15:50:48,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1596 transitions. [2022-11-23 15:50:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 15:50:48,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:48,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:48,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-23 15:50:49,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:49,102 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 15:50:49,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:49,103 INFO L85 PathProgramCache]: Analyzing trace with hash 331259283, now seen corresponding path program 4 times [2022-11-23 15:50:49,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:50:49,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226948556] [2022-11-23 15:50:49,104 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 15:50:49,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-23 15:50:49,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:50:49,106 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:49,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-23 15:50:49,328 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 15:50:49,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-23 15:50:49,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 15:50:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:50:49,577 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-23 15:50:49,577 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 15:50:49,579 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-23 15:50:49,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-23 15:50:49,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-23 15:50:49,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-23 15:50:49,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-23 15:50:49,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-23 15:50:49,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-23 15:50:49,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-23 15:50:49,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-23 15:50:49,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-23 15:50:49,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-23 15:50:49,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-23 15:50:49,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-23 15:50:49,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-23 15:50:49,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-23 15:50:49,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-23 15:50:49,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-23 15:50:49,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/mathsat -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-23 15:50:49,801 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:49,805 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 15:50:49,805 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:50:49,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:50:49 BasicIcfg [2022-11-23 15:50:49,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:50:49,968 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:50:49,971 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:50:49,972 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:50:49,972 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:50:25" (3/4) ... [2022-11-23 15:50:49,975 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 15:50:49,976 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:50:49,977 INFO L158 Benchmark]: Toolchain (without parser) took 26587.16ms. Allocated memory was 73.4MB in the beginning and 639.6MB in the end (delta: 566.2MB). Free memory was 49.3MB in the beginning and 278.0MB in the end (delta: -228.7MB). Peak memory consumption was 339.7MB. Max. memory is 16.1GB. [2022-11-23 15:50:49,978 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 73.4MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:50:49,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 737.80ms. Allocated memory is still 73.4MB. Free memory was 49.2MB in the beginning and 41.3MB in the end (delta: 7.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 15:50:49,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.04ms. Allocated memory is still 73.4MB. Free memory was 41.3MB in the beginning and 38.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:50:49,979 INFO L158 Benchmark]: Boogie Preprocessor took 89.88ms. Allocated memory is still 73.4MB. Free memory was 38.8MB in the beginning and 36.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:50:49,979 INFO L158 Benchmark]: RCFGBuilder took 1182.99ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 36.5MB in the beginning and 43.9MB in the end (delta: -7.4MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-11-23 15:50:49,980 INFO L158 Benchmark]: TraceAbstraction took 24452.00ms. Allocated memory was 88.1MB in the beginning and 639.6MB in the end (delta: 551.6MB). Free memory was 43.3MB in the beginning and 279.1MB in the end (delta: -235.8MB). Peak memory consumption was 314.2MB. Max. memory is 16.1GB. [2022-11-23 15:50:49,980 INFO L158 Benchmark]: Witness Printer took 8.07ms. Allocated memory is still 639.6MB. Free memory was 279.1MB in the beginning and 278.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:50:49,982 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 73.4MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 737.80ms. Allocated memory is still 73.4MB. Free memory was 49.2MB in the beginning and 41.3MB in the end (delta: 7.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.04ms. Allocated memory is still 73.4MB. Free memory was 41.3MB in the beginning and 38.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.88ms. Allocated memory is still 73.4MB. Free memory was 38.8MB in the beginning and 36.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1182.99ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 36.5MB in the beginning and 43.9MB in the end (delta: -7.4MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 24452.00ms. Allocated memory was 88.1MB in the beginning and 639.6MB in the end (delta: 551.6MB). Free memory was 43.3MB in the beginning and 279.1MB in the end (delta: -235.8MB). Peak memory consumption was 314.2MB. Max. memory is 16.1GB. * Witness Printer took 8.07ms. Allocated memory is still 639.6MB. Free memory was 279.1MB in the beginning and 278.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.1s, 158 PlacesBefore, 56 PlacesAfterwards, 147 TransitionsBefore, 44 TransitionsAfterwards, 3644 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 141 TotalNumberOfCompositions, 10235 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5436, independent: 5219, independent conditional: 0, independent unconditional: 5219, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2551, independent: 2484, independent conditional: 0, independent unconditional: 2484, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2551, independent: 2458, independent conditional: 0, independent unconditional: 2458, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 520, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 475, dependent conditional: 0, dependent unconditional: 475, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5436, independent: 2735, independent conditional: 0, independent unconditional: 2735, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 2551, unknown conditional: 0, unknown unconditional: 2551] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 284, Positive conditional cache size: 0, Positive unconditional cache size: 284, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool a$flush_delayed; [L716] 0 int a$mem_tmp; [L717] 0 _Bool a$r_buff0_thd0; [L718] 0 _Bool a$r_buff0_thd1; [L719] 0 _Bool a$r_buff0_thd2; [L720] 0 _Bool a$r_buff0_thd3; [L721] 0 _Bool a$r_buff0_thd4; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1513; [L858] FCALL, FORK 0 pthread_create(&t1513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1513, ((void *)0), P0, ((void *)0))=-1, t1513={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L755] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L859] 0 pthread_t t1514; [L860] FCALL, FORK 0 pthread_create(&t1514, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1514, ((void *)0), P1, ((void *)0))=0, t1513={3:0}, t1514={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L861] 0 pthread_t t1515; [L776] 2 x = 2 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 y = 1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L862] FCALL, FORK 0 pthread_create(&t1515, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1515, ((void *)0), P2, ((void *)0))=1, t1513={3:0}, t1514={7:0}, t1515={11:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L863] 0 pthread_t t1516; [L796] 3 y = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L864] FCALL, FORK 0 pthread_create(&t1516, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1516, ((void *)0), P3, ((void *)0))=2, t1513={3:0}, t1514={7:0}, t1515={11:0}, t1516={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L799] 3 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L816] 4 z = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L819] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 4 a$flush_delayed = weak$$choice2 [L822] 4 a$mem_tmp = a [L823] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L824] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L825] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L826] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L827] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L829] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 __unbuffered_p3_EAX = a [L831] 4 a = a$flush_delayed ? a$mem_tmp : a [L832] 4 a$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=2] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=2] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L835] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L836] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L837] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L838] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L839] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=2] [L842] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 4 return 0; [L802] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L803] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L804] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L805] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L806] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=2] [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L871] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L872] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L873] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L874] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1513={3:0}, t1514={7:0}, t1515={11:0}, t1516={15:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=2] [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=1, unknown-#in~expression-unknown=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 862]: 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 9 procedures, 183 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 24.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 459 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 459 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 211 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1970 IncrementalHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 79 mSDtfsCounter, 1970 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5498occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 263 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 178 ConstructedInterpolants, 13 QuantifiedInterpolants, 2040 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1503 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-23 15:50:50,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33b10afd-337a-452b-88ea-698c24d952fe/bin/utaipan-Q6hlc19bkW/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