./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/thin002_rmo.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/thin002_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS --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 f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 --- 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-8393723 [2022-11-19 07:56:01,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:56:01,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:56:01,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:56:01,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:56:01,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:56:01,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:56:01,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:56:01,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:56:01,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:56:01,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:56:01,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:56:01,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:56:01,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:56:01,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:56:01,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:56:01,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:56:01,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:56:01,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:56:01,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:56:01,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:56:01,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:56:01,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:56:01,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:56:01,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:56:01,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:56:01,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:56:01,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:56:01,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:56:01,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:56:01,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:56:01,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:56:01,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:56:01,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:56:01,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:56:01,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:56:01,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:56:01,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:56:01,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:56:01,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:56:01,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:56:01,325 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 07:56:01,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:56:01,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:56:01,373 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:56:01,373 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:56:01,374 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:56:01,375 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:56:01,375 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:56:01,375 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:56:01,375 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:56:01,376 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:56:01,377 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:56:01,377 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:56:01,377 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:56:01,377 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:56:01,378 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:56:01,378 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:56:01,378 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:56:01,378 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:56:01,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:56:01,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:56:01,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:56:01,380 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:56:01,380 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:56:01,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:56:01,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:56:01,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:56:01,381 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:56:01,381 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:56:01,381 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:56:01,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:56:01,382 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:56:01,383 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:56:01,384 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:56:01,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:56:01,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:56:01,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:56:01,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:56:01,385 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:56:01,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:56:01,386 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:56:01,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:56:01,386 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:56:01,386 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_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/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_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS 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 -> f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 [2022-11-19 07:56:01,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:56:01,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:56:01,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:56:01,713 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:56:01,713 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:56:01,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/thin002_rmo.i [2022-11-19 07:56:01,785 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/data/7386f56e4/f9e5c71979374ebcb2960b2fd0ab9c63/FLAG39b44271a [2022-11-19 07:56:02,436 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:56:02,438 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/sv-benchmarks/c/pthread-wmm/thin002_rmo.i [2022-11-19 07:56:02,456 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/data/7386f56e4/f9e5c71979374ebcb2960b2fd0ab9c63/FLAG39b44271a [2022-11-19 07:56:02,688 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/data/7386f56e4/f9e5c71979374ebcb2960b2fd0ab9c63 [2022-11-19 07:56:02,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:56:02,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:56:02,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:56:02,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:56:02,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:56:02,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:56:02" (1/1) ... [2022-11-19 07:56:02,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e09a309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:02, skipping insertion in model container [2022-11-19 07:56:02,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:56:02" (1/1) ... [2022-11-19 07:56:02,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:56:02,746 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:56:02,952 WARN L234 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_a4a8f932-d269-40b6-ade2-bb67668111a4/sv-benchmarks/c/pthread-wmm/thin002_rmo.i[988,1001] [2022-11-19 07:56:03,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:56:03,205 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:56:03,224 WARN L234 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_a4a8f932-d269-40b6-ade2-bb67668111a4/sv-benchmarks/c/pthread-wmm/thin002_rmo.i[988,1001] [2022-11-19 07:56:03,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:56:03,307 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:56:03,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:03 WrapperNode [2022-11-19 07:56:03,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:56:03,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:56:03,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:56:03,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:56:03,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:03" (1/1) ... [2022-11-19 07:56:03,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:03" (1/1) ... [2022-11-19 07:56:03,394 INFO L138 Inliner]: procedures = 177, calls = 80, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 154 [2022-11-19 07:56:03,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:56:03,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:56:03,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:56:03,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:56:03,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:03" (1/1) ... [2022-11-19 07:56:03,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:03" (1/1) ... [2022-11-19 07:56:03,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:03" (1/1) ... [2022-11-19 07:56:03,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:03" (1/1) ... [2022-11-19 07:56:03,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:03" (1/1) ... [2022-11-19 07:56:03,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:03" (1/1) ... [2022-11-19 07:56:03,427 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:03" (1/1) ... [2022-11-19 07:56:03,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:03" (1/1) ... [2022-11-19 07:56:03,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:56:03,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:56:03,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:56:03,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:56:03,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:03" (1/1) ... [2022-11-19 07:56:03,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:56:03,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:56:03,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:56:03,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:56:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 07:56:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:56:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:56:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:56:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:56:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:56:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:56:03,519 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:56:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:56:03,519 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:56:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:56:03,519 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:56:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-19 07:56:03,519 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-19 07:56:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:56:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:56:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:56:03,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:56:03,522 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:56:03,678 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:56:03,680 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:56:04,321 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:56:04,708 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:56:04,709 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:56:04,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:04 BoogieIcfgContainer [2022-11-19 07:56:04,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:56:04,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:56:04,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:56:04,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:56:04,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:56:02" (1/3) ... [2022-11-19 07:56:04,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e2a5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:56:04, skipping insertion in model container [2022-11-19 07:56:04,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:03" (2/3) ... [2022-11-19 07:56:04,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e2a5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:56:04, skipping insertion in model container [2022-11-19 07:56:04,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:04" (3/3) ... [2022-11-19 07:56:04,723 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_rmo.i [2022-11-19 07:56:04,742 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:56:04,742 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-11-19 07:56:04,743 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:56:04,869 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:56:04,913 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:56:04,928 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 190 transitions, 400 flow [2022-11-19 07:56:04,938 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 190 transitions, 400 flow [2022-11-19 07:56:04,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 190 transitions, 400 flow [2022-11-19 07:56:05,037 INFO L130 PetriNetUnfolder]: 2/186 cut-off events. [2022-11-19 07:56:05,037 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:56:05,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 2/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 198 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-11-19 07:56:05,052 INFO L119 LiptonReduction]: Number of co-enabled transitions 6364 [2022-11-19 07:56:20,942 INFO L134 LiptonReduction]: Checked pairs total: 23965 [2022-11-19 07:56:20,942 INFO L136 LiptonReduction]: Total number of compositions: 178 [2022-11-19 07:56:20,951 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 70 transitions, 160 flow [2022-11-19 07:56:23,113 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 46644 states, 45746 states have (on average 4.390045031259564) internal successors, (200827), 46643 states have internal predecessors, (200827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:23,138 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:56:23,148 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;@7ae0b463, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:56:23,148 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2022-11-19 07:56:23,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 46644 states, 45746 states have (on average 4.390045031259564) internal successors, (200827), 46643 states have internal predecessors, (200827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:56:23,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:23,286 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:56:23,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:23,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:23,293 INFO L85 PathProgramCache]: Analyzing trace with hash 890, now seen corresponding path program 1 times [2022-11-19 07:56:23,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:23,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254652176] [2022-11-19 07:56:23,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:56:23,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:23,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254652176] [2022-11-19 07:56:23,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254652176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:23,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:23,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:56:23,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423484322] [2022-11-19 07:56:23,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:23,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:56:23,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:23,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:56:23,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:56:23,590 INFO L87 Difference]: Start difference. First operand has 46644 states, 45746 states have (on average 4.390045031259564) internal successors, (200827), 46643 states have internal predecessors, (200827), 0 states have call successors, (0), 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-19 07:56:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:24,169 INFO L93 Difference]: Finished difference Result 14108 states and 58253 transitions. [2022-11-19 07:56:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:56:24,172 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-19 07:56:24,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:24,351 INFO L225 Difference]: With dead ends: 14108 [2022-11-19 07:56:24,352 INFO L226 Difference]: Without dead ends: 14108 [2022-11-19 07:56:24,352 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-19 07:56:24,356 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:24,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:24,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14108 states. [2022-11-19 07:56:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14108 to 14108. [2022-11-19 07:56:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14108 states, 13974 states have (on average 4.168670387863174) internal successors, (58253), 14107 states have internal predecessors, (58253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:25,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14108 states to 14108 states and 58253 transitions. [2022-11-19 07:56:25,492 INFO L78 Accepts]: Start accepts. Automaton has 14108 states and 58253 transitions. Word has length 1 [2022-11-19 07:56:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:25,495 INFO L495 AbstractCegarLoop]: Abstraction has 14108 states and 58253 transitions. [2022-11-19 07:56:25,495 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-19 07:56:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 14108 states and 58253 transitions. [2022-11-19 07:56:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 07:56:25,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:25,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 07:56:25,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:56:25,497 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:25,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:25,498 INFO L85 PathProgramCache]: Analyzing trace with hash 876189, now seen corresponding path program 1 times [2022-11-19 07:56:25,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:25,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152701193] [2022-11-19 07:56:25,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:25,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:25,816 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-19 07:56:25,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:25,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152701193] [2022-11-19 07:56:25,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152701193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:25,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:25,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:56:25,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792273429] [2022-11-19 07:56:25,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:25,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:56:25,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:25,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:56:25,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:56:25,825 INFO L87 Difference]: Start difference. First operand 14108 states and 58253 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-19 07:56:26,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:26,139 INFO L93 Difference]: Finished difference Result 11645 states and 45566 transitions. [2022-11-19 07:56:26,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:56:26,140 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-19 07:56:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:26,223 INFO L225 Difference]: With dead ends: 11645 [2022-11-19 07:56:26,224 INFO L226 Difference]: Without dead ends: 11549 [2022-11-19 07:56:26,225 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-19 07:56:26,227 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:26,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 7 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11549 states. [2022-11-19 07:56:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11549 to 9885. [2022-11-19 07:56:26,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9885 states, 9836 states have (on average 4.077877185847906) internal successors, (40110), 9884 states have internal predecessors, (40110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9885 states to 9885 states and 40110 transitions. [2022-11-19 07:56:26,904 INFO L78 Accepts]: Start accepts. Automaton has 9885 states and 40110 transitions. Word has length 3 [2022-11-19 07:56:26,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:26,905 INFO L495 AbstractCegarLoop]: Abstraction has 9885 states and 40110 transitions. [2022-11-19 07:56:26,905 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-19 07:56:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 9885 states and 40110 transitions. [2022-11-19 07:56:26,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 07:56:26,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:26,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 07:56:26,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:56:26,907 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:26,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:26,908 INFO L85 PathProgramCache]: Analyzing trace with hash 876190, now seen corresponding path program 1 times [2022-11-19 07:56:26,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:26,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978820170] [2022-11-19 07:56:26,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:26,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:27,032 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-19 07:56:27,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:27,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978820170] [2022-11-19 07:56:27,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978820170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:27,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:27,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:56:27,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787432958] [2022-11-19 07:56:27,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:27,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:56:27,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:27,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:56:27,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:56:27,035 INFO L87 Difference]: Start difference. First operand 9885 states and 40110 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-19 07:56:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:27,176 INFO L93 Difference]: Finished difference Result 6542 states and 25719 transitions. [2022-11-19 07:56:27,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:56:27,177 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-19 07:56:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:27,224 INFO L225 Difference]: With dead ends: 6542 [2022-11-19 07:56:27,224 INFO L226 Difference]: Without dead ends: 6446 [2022-11-19 07:56:27,225 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-19 07:56:27,229 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:27,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:27,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6446 states. [2022-11-19 07:56:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6446 to 6446. [2022-11-19 07:56:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6446 states, 6428 states have (on average 3.9612632233976353) internal successors, (25463), 6445 states have internal predecessors, (25463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6446 states to 6446 states and 25463 transitions. [2022-11-19 07:56:27,597 INFO L78 Accepts]: Start accepts. Automaton has 6446 states and 25463 transitions. Word has length 3 [2022-11-19 07:56:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:27,598 INFO L495 AbstractCegarLoop]: Abstraction has 6446 states and 25463 transitions. [2022-11-19 07:56:27,598 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-19 07:56:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 6446 states and 25463 transitions. [2022-11-19 07:56:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:56:27,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:27,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:56:27,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:56:27,604 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:27,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:27,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1455684034, now seen corresponding path program 1 times [2022-11-19 07:56:27,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:27,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343552864] [2022-11-19 07:56:27,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:27,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:27,878 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-19 07:56:27,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:27,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343552864] [2022-11-19 07:56:27,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343552864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:27,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:27,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:56:27,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249938097] [2022-11-19 07:56:27,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:27,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:56:27,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:27,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:56:27,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:56:27,888 INFO L87 Difference]: Start difference. First operand 6446 states and 25463 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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-19 07:56:28,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:28,202 INFO L93 Difference]: Finished difference Result 6286 states and 24775 transitions. [2022-11-19 07:56:28,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:56:28,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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-19 07:56:28,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:28,236 INFO L225 Difference]: With dead ends: 6286 [2022-11-19 07:56:28,237 INFO L226 Difference]: Without dead ends: 6286 [2022-11-19 07:56:28,237 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-19 07:56:28,238 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:28,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 14 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:28,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6286 states. [2022-11-19 07:56:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6286 to 6286. [2022-11-19 07:56:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6286 states, 6268 states have (on average 3.952616464582004) internal successors, (24775), 6285 states have internal predecessors, (24775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:28,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6286 states to 6286 states and 24775 transitions. [2022-11-19 07:56:28,450 INFO L78 Accepts]: Start accepts. Automaton has 6286 states and 24775 transitions. Word has length 13 [2022-11-19 07:56:28,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:28,451 INFO L495 AbstractCegarLoop]: Abstraction has 6286 states and 24775 transitions. [2022-11-19 07:56:28,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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-19 07:56:28,452 INFO L276 IsEmpty]: Start isEmpty. Operand 6286 states and 24775 transitions. [2022-11-19 07:56:28,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:56:28,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:28,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:56:28,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:56:28,454 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:28,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:28,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1585736635, now seen corresponding path program 1 times [2022-11-19 07:56:28,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:28,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402432465] [2022-11-19 07:56:28,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:28,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:28,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-19 07:56:28,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:28,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402432465] [2022-11-19 07:56:28,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402432465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:28,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:28,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:56:28,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275387331] [2022-11-19 07:56:28,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:28,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:56:28,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:28,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:56:28,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:56:28,936 INFO L87 Difference]: Start difference. First operand 6286 states and 24775 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:29,233 INFO L93 Difference]: Finished difference Result 6046 states and 23823 transitions. [2022-11-19 07:56:29,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:56:29,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 07:56:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:29,296 INFO L225 Difference]: With dead ends: 6046 [2022-11-19 07:56:29,297 INFO L226 Difference]: Without dead ends: 6046 [2022-11-19 07:56:29,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:56:29,298 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:29,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 17 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:56:29,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2022-11-19 07:56:29,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 6046. [2022-11-19 07:56:29,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6046 states, 6029 states have (on average 3.9514015591308675) internal successors, (23823), 6045 states have internal predecessors, (23823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6046 states to 6046 states and 23823 transitions. [2022-11-19 07:56:29,680 INFO L78 Accepts]: Start accepts. Automaton has 6046 states and 23823 transitions. Word has length 14 [2022-11-19 07:56:29,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:29,680 INFO L495 AbstractCegarLoop]: Abstraction has 6046 states and 23823 transitions. [2022-11-19 07:56:29,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 6046 states and 23823 transitions. [2022-11-19 07:56:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:56:29,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:29,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:56:29,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:56:29,682 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:29,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1585736634, now seen corresponding path program 1 times [2022-11-19 07:56:29,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:29,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702057624] [2022-11-19 07:56:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:30,103 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-19 07:56:30,103 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:30,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702057624] [2022-11-19 07:56:30,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702057624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:30,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:30,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:56:30,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468420026] [2022-11-19 07:56:30,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:30,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:56:30,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:30,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:56:30,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:56:30,105 INFO L87 Difference]: Start difference. First operand 6046 states and 23823 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:30,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:30,275 INFO L93 Difference]: Finished difference Result 5806 states and 22871 transitions. [2022-11-19 07:56:30,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:56:30,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 07:56:30,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:30,302 INFO L225 Difference]: With dead ends: 5806 [2022-11-19 07:56:30,302 INFO L226 Difference]: Without dead ends: 5806 [2022-11-19 07:56:30,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:56:30,303 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 88 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:30,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 12 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5806 states. [2022-11-19 07:56:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5806 to 5806. [2022-11-19 07:56:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5806 states, 5790 states have (on average 3.9500863557858374) internal successors, (22871), 5805 states have internal predecessors, (22871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5806 states to 5806 states and 22871 transitions. [2022-11-19 07:56:30,594 INFO L78 Accepts]: Start accepts. Automaton has 5806 states and 22871 transitions. Word has length 14 [2022-11-19 07:56:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:30,594 INFO L495 AbstractCegarLoop]: Abstraction has 5806 states and 22871 transitions. [2022-11-19 07:56:30,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 5806 states and 22871 transitions. [2022-11-19 07:56:30,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:56:30,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:30,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:56:30,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:56:30,598 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:30,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2118430511, now seen corresponding path program 1 times [2022-11-19 07:56:30,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:30,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889764429] [2022-11-19 07:56:30,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:30,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:30,959 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-19 07:56:30,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:30,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889764429] [2022-11-19 07:56:30,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889764429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:30,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:30,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:56:30,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788514874] [2022-11-19 07:56:30,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:30,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:56:30,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:30,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:56:30,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:56:30,962 INFO L87 Difference]: Start difference. First operand 5806 states and 22871 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 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-19 07:56:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:31,107 INFO L93 Difference]: Finished difference Result 5786 states and 22780 transitions. [2022-11-19 07:56:31,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:56:31,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 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-19 07:56:31,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:31,133 INFO L225 Difference]: With dead ends: 5786 [2022-11-19 07:56:31,134 INFO L226 Difference]: Without dead ends: 5786 [2022-11-19 07:56:31,134 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-19 07:56:31,135 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:31,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 14 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5786 states. [2022-11-19 07:56:31,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5786 to 5786. [2022-11-19 07:56:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5786 states, 5770 states have (on average 3.948006932409012) internal successors, (22780), 5785 states have internal predecessors, (22780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5786 states to 5786 states and 22780 transitions. [2022-11-19 07:56:31,405 INFO L78 Accepts]: Start accepts. Automaton has 5786 states and 22780 transitions. Word has length 14 [2022-11-19 07:56:31,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:31,406 INFO L495 AbstractCegarLoop]: Abstraction has 5786 states and 22780 transitions. [2022-11-19 07:56:31,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 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-19 07:56:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 5786 states and 22780 transitions. [2022-11-19 07:56:31,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:56:31,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:31,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:56:31,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:56:31,408 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:31,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:31,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1913200120, now seen corresponding path program 1 times [2022-11-19 07:56:31,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:31,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864622260] [2022-11-19 07:56:31,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:31,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:31,682 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-19 07:56:31,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:31,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864622260] [2022-11-19 07:56:31,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864622260] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:31,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:31,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:56:31,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517886838] [2022-11-19 07:56:31,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:31,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:56:31,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:31,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:56:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:56:31,685 INFO L87 Difference]: Start difference. First operand 5786 states and 22780 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:31,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:31,815 INFO L93 Difference]: Finished difference Result 5726 states and 22527 transitions. [2022-11-19 07:56:31,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:56:31,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 07:56:31,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:31,840 INFO L225 Difference]: With dead ends: 5726 [2022-11-19 07:56:31,840 INFO L226 Difference]: Without dead ends: 5726 [2022-11-19 07:56:31,841 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-19 07:56:31,842 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:31,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 13 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2022-11-19 07:56:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 5726. [2022-11-19 07:56:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5726 states, 5710 states have (on average 3.945183887915937) internal successors, (22527), 5725 states have internal predecessors, (22527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5726 states to 5726 states and 22527 transitions. [2022-11-19 07:56:32,018 INFO L78 Accepts]: Start accepts. Automaton has 5726 states and 22527 transitions. Word has length 15 [2022-11-19 07:56:32,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:32,018 INFO L495 AbstractCegarLoop]: Abstraction has 5726 states and 22527 transitions. [2022-11-19 07:56:32,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:32,019 INFO L276 IsEmpty]: Start isEmpty. Operand 5726 states and 22527 transitions. [2022-11-19 07:56:32,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:56:32,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:32,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:56:32,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:56:32,094 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:32,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:32,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1246834221, now seen corresponding path program 1 times [2022-11-19 07:56:32,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:32,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346467430] [2022-11-19 07:56:32,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:32,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:32,348 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-19 07:56:32,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:32,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346467430] [2022-11-19 07:56:32,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346467430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:32,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:32,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:56:32,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585311016] [2022-11-19 07:56:32,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:32,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:56:32,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:32,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:56:32,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:56:32,352 INFO L87 Difference]: Start difference. First operand 5726 states and 22527 transitions. Second operand has 4 states, 3 states have (on average 5.0) 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-19 07:56:32,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:32,574 INFO L93 Difference]: Finished difference Result 7640 states and 29380 transitions. [2022-11-19 07:56:32,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:56:32,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) 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-19 07:56:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:32,616 INFO L225 Difference]: With dead ends: 7640 [2022-11-19 07:56:32,616 INFO L226 Difference]: Without dead ends: 7640 [2022-11-19 07:56:32,617 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-19 07:56:32,617 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 82 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:32,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 18 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:32,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7640 states. [2022-11-19 07:56:32,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7640 to 6038. [2022-11-19 07:56:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6038 states, 6022 states have (on average 3.913816007970774) internal successors, (23569), 6037 states have internal predecessors, (23569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6038 states to 6038 states and 23569 transitions. [2022-11-19 07:56:32,896 INFO L78 Accepts]: Start accepts. Automaton has 6038 states and 23569 transitions. Word has length 15 [2022-11-19 07:56:32,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:32,897 INFO L495 AbstractCegarLoop]: Abstraction has 6038 states and 23569 transitions. [2022-11-19 07:56:32,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) 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-19 07:56:32,897 INFO L276 IsEmpty]: Start isEmpty. Operand 6038 states and 23569 transitions. [2022-11-19 07:56:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:56:32,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:32,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:56:32,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:56:32,901 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:32,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:32,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2778220, now seen corresponding path program 1 times [2022-11-19 07:56:32,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:32,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551260241] [2022-11-19 07:56:32,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:32,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:33,114 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-19 07:56:33,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:33,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551260241] [2022-11-19 07:56:33,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551260241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:33,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:33,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:56:33,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323480881] [2022-11-19 07:56:33,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:33,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:56:33,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:33,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:56:33,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:56:33,118 INFO L87 Difference]: Start difference. First operand 6038 states and 23569 transitions. Second operand has 5 states, 4 states have (on average 4.0) 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-19 07:56:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:33,307 INFO L93 Difference]: Finished difference Result 6694 states and 25129 transitions. [2022-11-19 07:56:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:56:33,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) 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-19 07:56:33,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:33,341 INFO L225 Difference]: With dead ends: 6694 [2022-11-19 07:56:33,341 INFO L226 Difference]: Without dead ends: 6694 [2022-11-19 07:56:33,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:56:33,342 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 51 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:33,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 13 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:33,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6694 states. [2022-11-19 07:56:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6694 to 5510. [2022-11-19 07:56:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5510 states, 5494 states have (on average 3.883691299599563) internal successors, (21337), 5509 states have internal predecessors, (21337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:33,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5510 states to 5510 states and 21337 transitions. [2022-11-19 07:56:33,580 INFO L78 Accepts]: Start accepts. Automaton has 5510 states and 21337 transitions. Word has length 16 [2022-11-19 07:56:33,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:33,581 INFO L495 AbstractCegarLoop]: Abstraction has 5510 states and 21337 transitions. [2022-11-19 07:56:33,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) 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-19 07:56:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 5510 states and 21337 transitions. [2022-11-19 07:56:33,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:56:33,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:33,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:56:33,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:56:33,585 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:33,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:33,586 INFO L85 PathProgramCache]: Analyzing trace with hash -92437731, now seen corresponding path program 1 times [2022-11-19 07:56:33,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:33,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770005726] [2022-11-19 07:56:33,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:33,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:33,802 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-19 07:56:33,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:33,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770005726] [2022-11-19 07:56:33,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770005726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:33,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:33,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:56:33,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876961949] [2022-11-19 07:56:33,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:33,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:56:33,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:33,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:56:33,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:56:33,806 INFO L87 Difference]: Start difference. First operand 5510 states and 21337 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:34,013 INFO L93 Difference]: Finished difference Result 7292 states and 27652 transitions. [2022-11-19 07:56:34,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:56:34,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 07:56:34,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:34,049 INFO L225 Difference]: With dead ends: 7292 [2022-11-19 07:56:34,050 INFO L226 Difference]: Without dead ends: 7292 [2022-11-19 07:56:34,050 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-19 07:56:34,051 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 73 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:34,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 20 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:34,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7292 states. [2022-11-19 07:56:34,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7292 to 5360. [2022-11-19 07:56:34,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5360 states, 5344 states have (on average 3.877994011976048) internal successors, (20724), 5359 states have internal predecessors, (20724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5360 states to 5360 states and 20724 transitions. [2022-11-19 07:56:34,290 INFO L78 Accepts]: Start accepts. Automaton has 5360 states and 20724 transitions. Word has length 17 [2022-11-19 07:56:34,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:34,290 INFO L495 AbstractCegarLoop]: Abstraction has 5360 states and 20724 transitions. [2022-11-19 07:56:34,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:34,291 INFO L276 IsEmpty]: Start isEmpty. Operand 5360 states and 20724 transitions. [2022-11-19 07:56:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:56:34,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:34,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:56:34,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:56:34,298 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:34,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:34,299 INFO L85 PathProgramCache]: Analyzing trace with hash -86122955, now seen corresponding path program 1 times [2022-11-19 07:56:34,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:34,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565315158] [2022-11-19 07:56:34,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:34,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:34,660 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-19 07:56:34,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:34,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565315158] [2022-11-19 07:56:34,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565315158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:34,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:34,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:56:34,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045788629] [2022-11-19 07:56:34,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:34,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:56:34,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:34,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:56:34,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:56:34,664 INFO L87 Difference]: Start difference. First operand 5360 states and 20724 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-19 07:56:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:34,888 INFO L93 Difference]: Finished difference Result 5744 states and 21380 transitions. [2022-11-19 07:56:34,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:56:34,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-19 07:56:34,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:34,917 INFO L225 Difference]: With dead ends: 5744 [2022-11-19 07:56:34,917 INFO L226 Difference]: Without dead ends: 5744 [2022-11-19 07:56:34,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:56:34,919 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 106 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:34,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 17 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:34,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5744 states. [2022-11-19 07:56:35,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5744 to 4832. [2022-11-19 07:56:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4832 states, 4816 states have (on average 3.839700996677741) internal successors, (18492), 4831 states have internal predecessors, (18492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4832 states to 4832 states and 18492 transitions. [2022-11-19 07:56:35,111 INFO L78 Accepts]: Start accepts. Automaton has 4832 states and 18492 transitions. Word has length 17 [2022-11-19 07:56:35,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:35,112 INFO L495 AbstractCegarLoop]: Abstraction has 4832 states and 18492 transitions. [2022-11-19 07:56:35,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-19 07:56:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4832 states and 18492 transitions. [2022-11-19 07:56:35,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:56:35,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:35,116 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-19 07:56:35,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:56:35,117 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:35,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:35,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1625155290, now seen corresponding path program 1 times [2022-11-19 07:56:35,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:35,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972364921] [2022-11-19 07:56:35,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:35,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:36,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-19 07:56:36,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:36,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972364921] [2022-11-19 07:56:36,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972364921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:36,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:36,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-19 07:56:36,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017338498] [2022-11-19 07:56:36,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:36,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 07:56:36,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:36,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 07:56:36,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:56:36,185 INFO L87 Difference]: Start difference. First operand 4832 states and 18492 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-19 07:56:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:37,482 INFO L93 Difference]: Finished difference Result 7158 states and 27385 transitions. [2022-11-19 07:56:37,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 07:56:37,483 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-19 07:56:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:37,506 INFO L225 Difference]: With dead ends: 7158 [2022-11-19 07:56:37,506 INFO L226 Difference]: Without dead ends: 6504 [2022-11-19 07:56:37,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-11-19 07:56:37,507 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 112 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:37,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 151 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-19 07:56:37,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6504 states. [2022-11-19 07:56:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6504 to 6444. [2022-11-19 07:56:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6444 states, 6428 states have (on average 3.7711574362165527) internal successors, (24241), 6443 states have internal predecessors, (24241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6444 states to 6444 states and 24241 transitions. [2022-11-19 07:56:37,760 INFO L78 Accepts]: Start accepts. Automaton has 6444 states and 24241 transitions. Word has length 18 [2022-11-19 07:56:37,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:37,761 INFO L495 AbstractCegarLoop]: Abstraction has 6444 states and 24241 transitions. [2022-11-19 07:56:37,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-19 07:56:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 6444 states and 24241 transitions. [2022-11-19 07:56:37,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:56:37,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:37,769 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-19 07:56:37,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 07:56:37,770 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:37,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:37,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1625155262, now seen corresponding path program 1 times [2022-11-19 07:56:37,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:37,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357426072] [2022-11-19 07:56:37,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:37,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:38,154 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-19 07:56:38,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:38,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357426072] [2022-11-19 07:56:38,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357426072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:38,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:38,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 07:56:38,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537826096] [2022-11-19 07:56:38,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:38,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 07:56:38,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:38,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 07:56:38,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:56:38,158 INFO L87 Difference]: Start difference. First operand 6444 states and 24241 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:38,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:38,475 INFO L93 Difference]: Finished difference Result 6236 states and 22337 transitions. [2022-11-19 07:56:38,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:56:38,476 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-19 07:56:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:38,503 INFO L225 Difference]: With dead ends: 6236 [2022-11-19 07:56:38,504 INFO L226 Difference]: Without dead ends: 6236 [2022-11-19 07:56:38,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:56:38,505 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 145 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:38,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 33 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:56:38,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6236 states. [2022-11-19 07:56:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6236 to 5520. [2022-11-19 07:56:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5520 states, 5504 states have (on average 3.6431686046511627) internal successors, (20052), 5519 states have internal predecessors, (20052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5520 states to 5520 states and 20052 transitions. [2022-11-19 07:56:38,719 INFO L78 Accepts]: Start accepts. Automaton has 5520 states and 20052 transitions. Word has length 18 [2022-11-19 07:56:38,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:38,720 INFO L495 AbstractCegarLoop]: Abstraction has 5520 states and 20052 transitions. [2022-11-19 07:56:38,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:38,720 INFO L276 IsEmpty]: Start isEmpty. Operand 5520 states and 20052 transitions. [2022-11-19 07:56:38,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 07:56:38,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:38,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:56:38,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 07:56:38,729 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:38,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:38,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1877818771, now seen corresponding path program 1 times [2022-11-19 07:56:38,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:38,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277332037] [2022-11-19 07:56:38,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:38,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:38,959 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-19 07:56:38,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:38,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277332037] [2022-11-19 07:56:38,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277332037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:38,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:38,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:56:38,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534581530] [2022-11-19 07:56:38,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:38,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:56:38,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:38,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:56:38,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:56:38,961 INFO L87 Difference]: Start difference. First operand 5520 states and 20052 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:39,094 INFO L93 Difference]: Finished difference Result 5508 states and 19996 transitions. [2022-11-19 07:56:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:56:39,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-19 07:56:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:39,119 INFO L225 Difference]: With dead ends: 5508 [2022-11-19 07:56:39,119 INFO L226 Difference]: Without dead ends: 5508 [2022-11-19 07:56:39,121 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-19 07:56:39,122 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:39,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:39,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5508 states. [2022-11-19 07:56:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5508 to 5508. [2022-11-19 07:56:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5508 states, 5492 states have (on average 3.6409322651128915) internal successors, (19996), 5507 states have internal predecessors, (19996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5508 states to 5508 states and 19996 transitions. [2022-11-19 07:56:39,321 INFO L78 Accepts]: Start accepts. Automaton has 5508 states and 19996 transitions. Word has length 19 [2022-11-19 07:56:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:39,324 INFO L495 AbstractCegarLoop]: Abstraction has 5508 states and 19996 transitions. [2022-11-19 07:56:39,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 5508 states and 19996 transitions. [2022-11-19 07:56:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 07:56:39,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:39,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:56:39,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 07:56:39,334 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:39,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:39,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1497066067, now seen corresponding path program 1 times [2022-11-19 07:56:39,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:39,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895829438] [2022-11-19 07:56:39,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:39,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:40,717 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-19 07:56:40,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:40,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895829438] [2022-11-19 07:56:40,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895829438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:40,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:40,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-19 07:56:40,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414577220] [2022-11-19 07:56:40,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:40,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 07:56:40,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:40,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 07:56:40,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:56:40,719 INFO L87 Difference]: Start difference. First operand 5508 states and 19996 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:41,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:41,887 INFO L93 Difference]: Finished difference Result 8004 states and 29406 transitions. [2022-11-19 07:56:41,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 07:56:41,887 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-19 07:56:41,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:41,912 INFO L225 Difference]: With dead ends: 8004 [2022-11-19 07:56:41,912 INFO L226 Difference]: Without dead ends: 7500 [2022-11-19 07:56:41,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-11-19 07:56:41,913 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 108 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:41,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 134 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-19 07:56:41,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7500 states. [2022-11-19 07:56:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7500 to 4752. [2022-11-19 07:56:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4752 states, 4740 states have (on average 3.6052742616033755) internal successors, (17089), 4751 states have internal predecessors, (17089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4752 states to 4752 states and 17089 transitions. [2022-11-19 07:56:42,113 INFO L78 Accepts]: Start accepts. Automaton has 4752 states and 17089 transitions. Word has length 19 [2022-11-19 07:56:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:42,113 INFO L495 AbstractCegarLoop]: Abstraction has 4752 states and 17089 transitions. [2022-11-19 07:56:42,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4752 states and 17089 transitions. [2022-11-19 07:56:42,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 07:56:42,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:42,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:56:42,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 07:56:42,123 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:42,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:42,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1159791294, now seen corresponding path program 1 times [2022-11-19 07:56:42,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:42,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461271445] [2022-11-19 07:56:42,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:42,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:42,237 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-19 07:56:42,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:42,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461271445] [2022-11-19 07:56:42,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461271445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:42,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:42,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:56:42,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352974677] [2022-11-19 07:56:42,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:42,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:56:42,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:42,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:56:42,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:56:42,240 INFO L87 Difference]: Start difference. First operand 4752 states and 17089 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:42,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:42,380 INFO L93 Difference]: Finished difference Result 5388 states and 19590 transitions. [2022-11-19 07:56:42,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:56:42,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-19 07:56:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:42,396 INFO L225 Difference]: With dead ends: 5388 [2022-11-19 07:56:42,397 INFO L226 Difference]: Without dead ends: 2942 [2022-11-19 07:56:42,397 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-19 07:56:42,398 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 56 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:42,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:42,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2022-11-19 07:56:42,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2546. [2022-11-19 07:56:42,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2541 states have (on average 3.5143644234553326) internal successors, (8930), 2545 states have internal predecessors, (8930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 8930 transitions. [2022-11-19 07:56:42,500 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 8930 transitions. Word has length 19 [2022-11-19 07:56:42,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:42,501 INFO L495 AbstractCegarLoop]: Abstraction has 2546 states and 8930 transitions. [2022-11-19 07:56:42,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:42,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 8930 transitions. [2022-11-19 07:56:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 07:56:42,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:42,506 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-19 07:56:42,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 07:56:42,507 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:42,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:42,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2032704859, now seen corresponding path program 1 times [2022-11-19 07:56:42,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:42,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407074823] [2022-11-19 07:56:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:42,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:42,771 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-19 07:56:42,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:42,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407074823] [2022-11-19 07:56:42,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407074823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:42,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:42,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:56:42,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675699282] [2022-11-19 07:56:42,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:42,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:56:42,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:42,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:56:42,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:56:42,775 INFO L87 Difference]: Start difference. First operand 2546 states and 8930 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-19 07:56:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:42,920 INFO L93 Difference]: Finished difference Result 3370 states and 11642 transitions. [2022-11-19 07:56:42,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:56:42,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-19 07:56:42,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:42,937 INFO L225 Difference]: With dead ends: 3370 [2022-11-19 07:56:42,937 INFO L226 Difference]: Without dead ends: 3106 [2022-11-19 07:56:42,937 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-19 07:56:42,938 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 66 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:42,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 16 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:42,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2022-11-19 07:56:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 2242. [2022-11-19 07:56:43,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2237 states have (on average 3.4975413500223516) internal successors, (7824), 2241 states have internal predecessors, (7824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 7824 transitions. [2022-11-19 07:56:43,028 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 7824 transitions. Word has length 20 [2022-11-19 07:56:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:43,028 INFO L495 AbstractCegarLoop]: Abstraction has 2242 states and 7824 transitions. [2022-11-19 07:56:43,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-19 07:56:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 7824 transitions. [2022-11-19 07:56:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 07:56:43,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:43,034 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-19 07:56:43,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-19 07:56:43,034 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:43,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:43,035 INFO L85 PathProgramCache]: Analyzing trace with hash 224663322, now seen corresponding path program 1 times [2022-11-19 07:56:43,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:43,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982376741] [2022-11-19 07:56:43,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:43,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:44,148 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-19 07:56:44,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:44,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982376741] [2022-11-19 07:56:44,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982376741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:44,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:44,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-19 07:56:44,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851758152] [2022-11-19 07:56:44,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:44,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-19 07:56:44,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:44,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-19 07:56:44,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:56:44,151 INFO L87 Difference]: Start difference. First operand 2242 states and 7824 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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-19 07:56:44,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:44,816 INFO L93 Difference]: Finished difference Result 1918 states and 6681 transitions. [2022-11-19 07:56:44,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:56:44,816 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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-19 07:56:44,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:44,818 INFO L225 Difference]: With dead ends: 1918 [2022-11-19 07:56:44,818 INFO L226 Difference]: Without dead ends: 490 [2022-11-19 07:56:44,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:56:44,819 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 70 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:44,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 138 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-19 07:56:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-11-19 07:56:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 304. [2022-11-19 07:56:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 2.716171617161716) internal successors, (823), 303 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 823 transitions. [2022-11-19 07:56:44,829 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 823 transitions. Word has length 20 [2022-11-19 07:56:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:44,829 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 823 transitions. [2022-11-19 07:56:44,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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-19 07:56:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 823 transitions. [2022-11-19 07:56:44,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:56:44,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:44,831 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-19 07:56:44,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-19 07:56:44,832 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:44,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash -697711734, now seen corresponding path program 1 times [2022-11-19 07:56:44,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:44,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118885304] [2022-11-19 07:56:44,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:44,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:46,433 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-19 07:56:46,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:46,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118885304] [2022-11-19 07:56:46,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118885304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:46,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:46,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 07:56:46,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332794194] [2022-11-19 07:56:46,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:46,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 07:56:46,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:46,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 07:56:46,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:56:46,436 INFO L87 Difference]: Start difference. First operand 304 states and 823 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-19 07:56:46,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:46,826 INFO L93 Difference]: Finished difference Result 487 states and 1308 transitions. [2022-11-19 07:56:46,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:56:46,827 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-19 07:56:46,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:46,828 INFO L225 Difference]: With dead ends: 487 [2022-11-19 07:56:46,829 INFO L226 Difference]: Without dead ends: 487 [2022-11-19 07:56:46,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-19 07:56:46,829 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:46,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 30 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:56:46,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-11-19 07:56:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2022-11-19 07:56:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 2.691358024691358) internal successors, (1308), 486 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1308 transitions. [2022-11-19 07:56:46,842 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1308 transitions. Word has length 21 [2022-11-19 07:56:46,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:46,843 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 1308 transitions. [2022-11-19 07:56:46,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-19 07:56:46,843 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1308 transitions. [2022-11-19 07:56:46,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:56:46,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:46,845 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-19 07:56:46,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-19 07:56:46,845 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:46,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:46,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1602615370, now seen corresponding path program 2 times [2022-11-19 07:56:46,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:46,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721914243] [2022-11-19 07:56:46,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:46,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:48,460 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-19 07:56:48,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:48,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721914243] [2022-11-19 07:56:48,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721914243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:48,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:48,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 07:56:48,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620121539] [2022-11-19 07:56:48,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:48,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 07:56:48,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:48,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 07:56:48,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:56:48,465 INFO L87 Difference]: Start difference. First operand 487 states and 1308 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-19 07:56:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:48,891 INFO L93 Difference]: Finished difference Result 655 states and 1763 transitions. [2022-11-19 07:56:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:56:48,892 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-19 07:56:48,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:48,894 INFO L225 Difference]: With dead ends: 655 [2022-11-19 07:56:48,894 INFO L226 Difference]: Without dead ends: 655 [2022-11-19 07:56:48,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-11-19 07:56:48,895 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 90 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:48,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 26 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:56:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2022-11-19 07:56:48,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 472. [2022-11-19 07:56:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 2.713375796178344) internal successors, (1278), 471 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1278 transitions. [2022-11-19 07:56:48,909 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1278 transitions. Word has length 21 [2022-11-19 07:56:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:48,910 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 1278 transitions. [2022-11-19 07:56:48,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-19 07:56:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1278 transitions. [2022-11-19 07:56:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:56:48,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:48,912 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-19 07:56:48,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-19 07:56:48,913 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:48,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:48,913 INFO L85 PathProgramCache]: Analyzing trace with hash -365925430, now seen corresponding path program 3 times [2022-11-19 07:56:48,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:48,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482210353] [2022-11-19 07:56:48,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:48,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:50,722 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-19 07:56:50,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:50,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482210353] [2022-11-19 07:56:50,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482210353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:50,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:50,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-19 07:56:50,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537777223] [2022-11-19 07:56:50,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:50,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-19 07:56:50,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:50,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-19 07:56:50,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:56:50,726 INFO L87 Difference]: Start difference. First operand 472 states and 1278 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-19 07:56:51,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:51,365 INFO L93 Difference]: Finished difference Result 601 states and 1637 transitions. [2022-11-19 07:56:51,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:56:51,366 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-19 07:56:51,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:51,368 INFO L225 Difference]: With dead ends: 601 [2022-11-19 07:56:51,368 INFO L226 Difference]: Without dead ends: 601 [2022-11-19 07:56:51,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:56:51,369 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 74 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:51,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 37 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:56:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-11-19 07:56:51,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 433. [2022-11-19 07:56:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 2.736111111111111) internal successors, (1182), 432 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1182 transitions. [2022-11-19 07:56:51,383 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1182 transitions. Word has length 21 [2022-11-19 07:56:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:51,383 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 1182 transitions. [2022-11-19 07:56:51,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-19 07:56:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1182 transitions. [2022-11-19 07:56:51,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:56:51,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:51,390 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-19 07:56:51,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-19 07:56:51,390 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:51,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash 94954766, now seen corresponding path program 4 times [2022-11-19 07:56:51,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:51,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827981868] [2022-11-19 07:56:51,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:51,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:52,891 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-19 07:56:52,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:52,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827981868] [2022-11-19 07:56:52,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827981868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:52,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:52,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 07:56:52,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564377462] [2022-11-19 07:56:52,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:52,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 07:56:52,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:52,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 07:56:52,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:56:52,893 INFO L87 Difference]: Start difference. First operand 433 states and 1182 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-19 07:56:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:53,296 INFO L93 Difference]: Finished difference Result 613 states and 1662 transitions. [2022-11-19 07:56:53,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 07:56:53,296 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-19 07:56:53,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:53,298 INFO L225 Difference]: With dead ends: 613 [2022-11-19 07:56:53,298 INFO L226 Difference]: Without dead ends: 613 [2022-11-19 07:56:53,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2022-11-19 07:56:53,298 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 66 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:53,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 39 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:56:53,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-11-19 07:56:53,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 433. [2022-11-19 07:56:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 2.736111111111111) internal successors, (1182), 432 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1182 transitions. [2022-11-19 07:56:53,304 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1182 transitions. Word has length 21 [2022-11-19 07:56:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:53,305 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 1182 transitions. [2022-11-19 07:56:53,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-19 07:56:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1182 transitions. [2022-11-19 07:56:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:56:53,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:53,306 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-19 07:56:53,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-19 07:56:53,306 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:53,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:53,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1318658280, now seen corresponding path program 5 times [2022-11-19 07:56:53,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:53,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767907548] [2022-11-19 07:56:53,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:53,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:56:54,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:54,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767907548] [2022-11-19 07:56:54,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767907548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:54,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:54,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 07:56:54,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075820009] [2022-11-19 07:56:54,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:54,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 07:56:54,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:54,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 07:56:54,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:56:54,783 INFO L87 Difference]: Start difference. First operand 433 states and 1182 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-19 07:56:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:55,367 INFO L93 Difference]: Finished difference Result 425 states and 1154 transitions. [2022-11-19 07:56:55,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 07:56:55,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-19 07:56:55,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:55,369 INFO L225 Difference]: With dead ends: 425 [2022-11-19 07:56:55,369 INFO L226 Difference]: Without dead ends: 425 [2022-11-19 07:56:55,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-11-19 07:56:55,370 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 63 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:55,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 25 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:56:55,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-11-19 07:56:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 296. [2022-11-19 07:56:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.694915254237288) internal successors, (795), 295 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 795 transitions. [2022-11-19 07:56:55,379 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 795 transitions. Word has length 21 [2022-11-19 07:56:55,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:55,379 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 795 transitions. [2022-11-19 07:56:55,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-19 07:56:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 795 transitions. [2022-11-19 07:56:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:56:55,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:55,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:56:55,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-19 07:56:55,380 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:55,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:55,380 INFO L85 PathProgramCache]: Analyzing trace with hash -154231407, now seen corresponding path program 1 times [2022-11-19 07:56:55,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:55,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13890540] [2022-11-19 07:56:55,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:55,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:55,555 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-19 07:56:55,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:55,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13890540] [2022-11-19 07:56:55,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13890540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:55,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:55,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:56:55,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205011949] [2022-11-19 07:56:55,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:55,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:56:55,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:55,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:56:55,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:56:55,558 INFO L87 Difference]: Start difference. First operand 296 states and 795 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:55,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:55,616 INFO L93 Difference]: Finished difference Result 274 states and 709 transitions. [2022-11-19 07:56:55,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:56:55,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 07:56:55,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:55,617 INFO L225 Difference]: With dead ends: 274 [2022-11-19 07:56:55,617 INFO L226 Difference]: Without dead ends: 274 [2022-11-19 07:56:55,618 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-19 07:56:55,618 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:55,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:55,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-19 07:56:55,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2022-11-19 07:56:55,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 2.597069597069597) internal successors, (709), 273 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 709 transitions. [2022-11-19 07:56:55,624 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 709 transitions. Word has length 22 [2022-11-19 07:56:55,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:55,625 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 709 transitions. [2022-11-19 07:56:55,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:55,625 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 709 transitions. [2022-11-19 07:56:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:56:55,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:55,626 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] [2022-11-19 07:56:55,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-19 07:56:55,626 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:55,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:55,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1726250027, now seen corresponding path program 1 times [2022-11-19 07:56:55,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:55,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307884511] [2022-11-19 07:56:55,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:55,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:55,818 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-19 07:56:55,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:55,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307884511] [2022-11-19 07:56:55,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307884511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:55,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:55,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:56:55,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879633278] [2022-11-19 07:56:55,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:55,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:56:55,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:55,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:56:55,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:56:55,821 INFO L87 Difference]: Start difference. First operand 274 states and 709 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:55,892 INFO L93 Difference]: Finished difference Result 229 states and 545 transitions. [2022-11-19 07:56:55,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:56:55,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-19 07:56:55,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:55,893 INFO L225 Difference]: With dead ends: 229 [2022-11-19 07:56:55,893 INFO L226 Difference]: Without dead ends: 229 [2022-11-19 07:56:55,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:56:55,894 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:55,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 15 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-19 07:56:55,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-11-19 07:56:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 2.3903508771929824) internal successors, (545), 228 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 545 transitions. [2022-11-19 07:56:55,899 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 545 transitions. Word has length 23 [2022-11-19 07:56:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:55,899 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 545 transitions. [2022-11-19 07:56:55,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 545 transitions. [2022-11-19 07:56:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 07:56:55,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:55,900 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-19 07:56:55,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-19 07:56:55,900 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:55,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1541020438, now seen corresponding path program 1 times [2022-11-19 07:56:55,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:55,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858666199] [2022-11-19 07:56:55,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:55,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:56,112 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-19 07:56:56,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:56,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858666199] [2022-11-19 07:56:56,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858666199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:56,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:56,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:56:56,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484659909] [2022-11-19 07:56:56,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:56,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:56:56,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:56,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:56:56,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:56:56,115 INFO L87 Difference]: Start difference. First operand 229 states and 545 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:56,206 INFO L93 Difference]: Finished difference Result 186 states and 420 transitions. [2022-11-19 07:56:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:56:56,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-19 07:56:56,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:56,207 INFO L225 Difference]: With dead ends: 186 [2022-11-19 07:56:56,207 INFO L226 Difference]: Without dead ends: 186 [2022-11-19 07:56:56,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:56:56,208 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 62 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:56,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 17 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-19 07:56:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-11-19 07:56:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.27027027027027) internal successors, (420), 185 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 420 transitions. [2022-11-19 07:56:56,211 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 420 transitions. Word has length 24 [2022-11-19 07:56:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:56,212 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 420 transitions. [2022-11-19 07:56:56,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 420 transitions. [2022-11-19 07:56:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:56:56,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:56,212 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] [2022-11-19 07:56:56,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-19 07:56:56,215 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:56,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:56,216 INFO L85 PathProgramCache]: Analyzing trace with hash 93722514, now seen corresponding path program 1 times [2022-11-19 07:56:56,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:56,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681048598] [2022-11-19 07:56:56,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:56,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:56:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:56:56,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:56:56,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681048598] [2022-11-19 07:56:56,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681048598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:56:56,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:56:56,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:56:56,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165921154] [2022-11-19 07:56:56,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:56:56,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:56:56,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:56,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:56:56,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:56:56,427 INFO L87 Difference]: Start difference. First operand 186 states and 420 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:56:56,526 INFO L93 Difference]: Finished difference Result 167 states and 382 transitions. [2022-11-19 07:56:56,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:56:56,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-19 07:56:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:56:56,527 INFO L225 Difference]: With dead ends: 167 [2022-11-19 07:56:56,527 INFO L226 Difference]: Without dead ends: 167 [2022-11-19 07:56:56,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:56:56,528 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 96 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:56:56,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 17 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:56:56,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-19 07:56:56,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-11-19 07:56:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.3012048192771086) internal successors, (382), 166 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 382 transitions. [2022-11-19 07:56:56,531 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 382 transitions. Word has length 25 [2022-11-19 07:56:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:56:56,531 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 382 transitions. [2022-11-19 07:56:56,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:56:56,531 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 382 transitions. [2022-11-19 07:56:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:56:56,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:56:56,532 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] [2022-11-19 07:56:56,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-19 07:56:56,532 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:56:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:56:56,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1297773194, now seen corresponding path program 1 times [2022-11-19 07:56:56,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:56:56,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593479298] [2022-11-19 07:56:56,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:56:56,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:56:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:56:56,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:56:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:56:56,679 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:56:56,679 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:56:56,680 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (55 of 56 remaining) [2022-11-19 07:56:56,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 56 remaining) [2022-11-19 07:56:56,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 56 remaining) [2022-11-19 07:56:56,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 56 remaining) [2022-11-19 07:56:56,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 56 remaining) [2022-11-19 07:56:56,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 56 remaining) [2022-11-19 07:56:56,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 56 remaining) [2022-11-19 07:56:56,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 56 remaining) [2022-11-19 07:56:56,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 56 remaining) [2022-11-19 07:56:56,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 56 remaining) [2022-11-19 07:56:56,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 56 remaining) [2022-11-19 07:56:56,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 56 remaining) [2022-11-19 07:56:56,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 56 remaining) [2022-11-19 07:56:56,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 56 remaining) [2022-11-19 07:56:56,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 56 remaining) [2022-11-19 07:56:56,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 56 remaining) [2022-11-19 07:56:56,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 56 remaining) [2022-11-19 07:56:56,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 56 remaining) [2022-11-19 07:56:56,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 56 remaining) [2022-11-19 07:56:56,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 56 remaining) [2022-11-19 07:56:56,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 56 remaining) [2022-11-19 07:56:56,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 56 remaining) [2022-11-19 07:56:56,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 56 remaining) [2022-11-19 07:56:56,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 56 remaining) [2022-11-19 07:56:56,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 56 remaining) [2022-11-19 07:56:56,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 56 remaining) [2022-11-19 07:56:56,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 56 remaining) [2022-11-19 07:56:56,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 56 remaining) [2022-11-19 07:56:56,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 56 remaining) [2022-11-19 07:56:56,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 56 remaining) [2022-11-19 07:56:56,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 56 remaining) [2022-11-19 07:56:56,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 56 remaining) [2022-11-19 07:56:56,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 56 remaining) [2022-11-19 07:56:56,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (22 of 56 remaining) [2022-11-19 07:56:56,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 56 remaining) [2022-11-19 07:56:56,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 56 remaining) [2022-11-19 07:56:56,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 56 remaining) [2022-11-19 07:56:56,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 56 remaining) [2022-11-19 07:56:56,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 56 remaining) [2022-11-19 07:56:56,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 56 remaining) [2022-11-19 07:56:56,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 56 remaining) [2022-11-19 07:56:56,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 56 remaining) [2022-11-19 07:56:56,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 56 remaining) [2022-11-19 07:56:56,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 56 remaining) [2022-11-19 07:56:56,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 56 remaining) [2022-11-19 07:56:56,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 56 remaining) [2022-11-19 07:56:56,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 56 remaining) [2022-11-19 07:56:56,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 56 remaining) [2022-11-19 07:56:56,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 56 remaining) [2022-11-19 07:56:56,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 56 remaining) [2022-11-19 07:56:56,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 56 remaining) [2022-11-19 07:56:56,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 56 remaining) [2022-11-19 07:56:56,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 56 remaining) [2022-11-19 07:56:56,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 56 remaining) [2022-11-19 07:56:56,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 56 remaining) [2022-11-19 07:56:56,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 56 remaining) [2022-11-19 07:56:56,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-19 07:56:56,697 INFO L444 BasicCegarLoop]: Path program histogram: [5, 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-19 07:56:56,703 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:56:56,703 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:56:56,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:56:56 BasicIcfg [2022-11-19 07:56:56,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:56:56,832 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:56:56,832 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:56:56,833 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:56:56,833 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:04" (3/4) ... [2022-11-19 07:56:56,836 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 07:56:56,836 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:56:56,836 INFO L158 Benchmark]: Toolchain (without parser) took 54144.72ms. Allocated memory was 107.0MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 77.3MB in the beginning and 4.9GB in the end (delta: -4.9GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2022-11-19 07:56:56,836 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 107.0MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:56:56,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.78ms. Allocated memory is still 107.0MB. Free memory was 77.0MB in the beginning and 69.6MB in the end (delta: 7.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:56:56,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.81ms. Allocated memory is still 107.0MB. Free memory was 69.6MB in the beginning and 67.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:56:56,837 INFO L158 Benchmark]: Boogie Preprocessor took 33.57ms. Allocated memory is still 107.0MB. Free memory was 67.2MB in the beginning and 64.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:56:56,838 INFO L158 Benchmark]: RCFGBuilder took 1278.56ms. Allocated memory was 107.0MB in the beginning and 142.6MB in the end (delta: 35.7MB). Free memory was 64.8MB in the beginning and 94.3MB in the end (delta: -29.5MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2022-11-19 07:56:56,838 INFO L158 Benchmark]: TraceAbstraction took 52117.22ms. Allocated memory was 142.6MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 93.3MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2022-11-19 07:56:56,838 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 6.8GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:56:56,840 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.21ms. Allocated memory is still 107.0MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 614.78ms. Allocated memory is still 107.0MB. Free memory was 77.0MB in the beginning and 69.6MB in the end (delta: 7.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.81ms. Allocated memory is still 107.0MB. Free memory was 69.6MB in the beginning and 67.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.57ms. Allocated memory is still 107.0MB. Free memory was 67.2MB in the beginning and 64.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1278.56ms. Allocated memory was 107.0MB in the beginning and 142.6MB in the end (delta: 35.7MB). Free memory was 64.8MB in the beginning and 94.3MB in the end (delta: -29.5MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * TraceAbstraction took 52117.22ms. Allocated memory was 142.6MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 93.3MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 6.8GB. Free memory was 4.9GB in the beginning and 4.9GB 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.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.0s, 201 PlacesBefore, 82 PlacesAfterwards, 190 TransitionsBefore, 70 TransitionsAfterwards, 6364 CoEnabledTransitionPairs, 9 FixpointIterations, 80 TrivialSequentialCompositions, 91 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 178 TotalNumberOfCompositions, 23965 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11681, independent: 11177, independent conditional: 0, independent unconditional: 11177, dependent: 445, dependent conditional: 0, dependent unconditional: 445, unknown: 59, unknown conditional: 0, unknown unconditional: 59] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4289, independent: 4195, independent conditional: 0, independent unconditional: 4195, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4289, independent: 3930, independent conditional: 0, independent unconditional: 3930, dependent: 359, dependent conditional: 0, dependent unconditional: 359, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 359, independent: 265, independent conditional: 0, independent unconditional: 265, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1936, independent: 1318, independent conditional: 0, independent unconditional: 1318, dependent: 499, dependent conditional: 0, dependent unconditional: 499, unknown: 119, unknown conditional: 0, unknown unconditional: 119] ], Cache Queries: [ total: 11681, independent: 6982, independent conditional: 0, independent unconditional: 6982, dependent: 357, dependent conditional: 0, dependent unconditional: 357, unknown: 4342, unknown conditional: 0, unknown unconditional: 4342] , Statistics on independence cache: Total cache size (in pairs): 685, Positive cache size: 642, Positive conditional cache size: 0, Positive unconditional cache size: 642, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 3, Unknown conditional cache size: 0, Unknown unconditional cache size: 3 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L757] 0 _Bool a$w_buff1_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L747] 0 _Bool a$r_buff1_thd0; [L711] 0 int __unbuffered_cnt = 0; [L753] 0 int *a$read_delayed_var; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L755] 0 _Bool a$w_buff0_used; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L713] 0 int __unbuffered_p0_EAX = 0; [L741] 0 int a$mem_tmp; [L752] 0 _Bool a$read_delayed; [L733] 0 int __unbuffered_p1_EAX = 0; [L739] 0 int a = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L754] 0 int a$w_buff0; [L756] 0 int a$w_buff1; [L740] 0 _Bool a$flush_delayed; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L759] 0 _Bool main$tmp_guard1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L758] 0 _Bool main$tmp_guard0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L742] 0 _Bool a$r_buff0_thd0; [L737] 0 int __unbuffered_p3_EAX = 0; [L745] 0 _Bool a$r_buff0_thd3; [L744] 0 _Bool a$r_buff0_thd2; [L746] 0 _Bool a$r_buff0_thd4; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L860] 0 pthread_t t2721; [L861] FCALL, FORK 0 pthread_create(&t2721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2721, ((void *)0), P0, ((void *)0))=-3, t2721={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] EXPR 1 \read(a) [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] 1 a = !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L777] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L778] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L779] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L780] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L781] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L782] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L783] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L784] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L785] EXPR 1 \read(a) [L785] 1 __unbuffered_p0_EAX = a [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] 1 a = a$flush_delayed ? a$mem_tmp : a [L787] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=0, y=0, z=0] [L790] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z=0] [L795] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 1 return 0; [L862] 0 pthread_t t2722; [L863] FCALL, FORK 0 pthread_create(&t2722, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2722, ((void *)0), P1, ((void *)0))=-2, t2721={7:0}, t2722={8:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z=0] [L864] 0 pthread_t t2723; [L802] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z=0] [L865] FCALL, FORK 0 pthread_create(&t2723, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2723, ((void *)0), P2, ((void *)0))=-1, t2721={7:0}, t2722={8:0}, t2723={5:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z=0] [L866] 0 pthread_t t2724; [L867] FCALL, FORK 0 pthread_create(&t2724, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2724, ((void *)0), P3, ((void *)0))=0, t2721={7:0}, t2722={8:0}, t2723={5:0}, t2724={6:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z=0] [L805] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=0] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L817] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=0] [L820] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L832] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=1] [L835] 4 a = 1 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=1] [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 \read(a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 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) [L839] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] 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 [L841] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] 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 [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=1] [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L871] RET 0 assume_abort_if_not(main$tmp_guard0) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 \read(a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 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) [L874] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] 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 [L876] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] 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 [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2721={7:0}, t2722={8:0}, t2723={5:0}, t2724={6:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=1] [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x=1, y=1, z=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 865]: 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: 867]: 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: 861]: 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, 240 locations, 56 error locations. Started 1 CEGAR loops. OverallTime: 51.8s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.2s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1705 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1705 mSDsluCounter, 862 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 628 mSDsCounter, 284 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4130 IncrementalHoareTripleChecker+Invalid, 4414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 284 mSolverCounterUnsat, 234 mSDtfsCounter, 4130 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46644occurred in iteration=0, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 12924 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 501 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 446 ConstructedInterpolants, 0 QuantifiedInterpolants, 7363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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-19 07:56:56,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/thin002_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS --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 f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 --- 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-8393723 [2022-11-19 07:56:59,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:56:59,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:56:59,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:56:59,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:56:59,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:56:59,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:56:59,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:56:59,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:56:59,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:56:59,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:56:59,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:56:59,430 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:56:59,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:56:59,434 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:56:59,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:56:59,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:56:59,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:56:59,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:56:59,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:56:59,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:56:59,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:56:59,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:56:59,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:56:59,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:56:59,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:56:59,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:56:59,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:56:59,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:56:59,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:56:59,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:56:59,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:56:59,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:56:59,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:56:59,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:56:59,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:56:59,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:56:59,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:56:59,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:56:59,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:56:59,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:56:59,486 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 07:56:59,534 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:56:59,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:56:59,535 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:56:59,535 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:56:59,536 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:56:59,537 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:56:59,537 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:56:59,537 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:56:59,537 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:56:59,537 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:56:59,539 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:56:59,539 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:56:59,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:56:59,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:56:59,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:56:59,541 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:56:59,541 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:56:59,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:56:59,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:56:59,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:56:59,542 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:56:59,542 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:56:59,542 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:56:59,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:56:59,543 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:56:59,543 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 07:56:59,543 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 07:56:59,544 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:56:59,544 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:56:59,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:56:59,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 07:56:59,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:56:59,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:56:59,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:56:59,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:56:59,546 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 07:56:59,546 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 07:56:59,546 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:56:59,547 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 07:56:59,547 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_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/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_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS 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 -> f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 [2022-11-19 07:56:59,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:56:59,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:56:59,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:56:59,927 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:56:59,928 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:56:59,929 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/thin002_rmo.i [2022-11-19 07:57:00,007 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/data/6a1601303/f575a363a28c4fd7bae61aab3599f51f/FLAG8442f0ca4 [2022-11-19 07:57:00,641 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:57:00,643 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/sv-benchmarks/c/pthread-wmm/thin002_rmo.i [2022-11-19 07:57:00,664 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/data/6a1601303/f575a363a28c4fd7bae61aab3599f51f/FLAG8442f0ca4 [2022-11-19 07:57:00,915 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/data/6a1601303/f575a363a28c4fd7bae61aab3599f51f [2022-11-19 07:57:00,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:57:00,919 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:57:00,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:57:00,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:57:00,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:57:00,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:57:00" (1/1) ... [2022-11-19 07:57:00,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac25927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:00, skipping insertion in model container [2022-11-19 07:57:00,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:57:00" (1/1) ... [2022-11-19 07:57:00,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:57:01,008 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:57:01,160 WARN L234 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_a4a8f932-d269-40b6-ade2-bb67668111a4/sv-benchmarks/c/pthread-wmm/thin002_rmo.i[988,1001] [2022-11-19 07:57:01,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:57:01,507 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:57:01,531 WARN L234 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_a4a8f932-d269-40b6-ade2-bb67668111a4/sv-benchmarks/c/pthread-wmm/thin002_rmo.i[988,1001] [2022-11-19 07:57:01,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:57:01,650 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:57:01,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:01 WrapperNode [2022-11-19 07:57:01,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:57:01,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:57:01,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:57:01,653 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:57:01,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:01" (1/1) ... [2022-11-19 07:57:01,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:01" (1/1) ... [2022-11-19 07:57:01,701 INFO L138 Inliner]: procedures = 181, calls = 80, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 155 [2022-11-19 07:57:01,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:57:01,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:57:01,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:57:01,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:57:01,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:01" (1/1) ... [2022-11-19 07:57:01,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:01" (1/1) ... [2022-11-19 07:57:01,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:01" (1/1) ... [2022-11-19 07:57:01,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:01" (1/1) ... [2022-11-19 07:57:01,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:01" (1/1) ... [2022-11-19 07:57:01,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:01" (1/1) ... [2022-11-19 07:57:01,744 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:01" (1/1) ... [2022-11-19 07:57:01,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:01" (1/1) ... [2022-11-19 07:57:01,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:57:01,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:57:01,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:57:01,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:57:01,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:01" (1/1) ... [2022-11-19 07:57:01,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:57:01,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:57:01,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:57:01,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:57:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-19 07:57:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:57:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:57:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:57:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:57:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 07:57:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 07:57:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-19 07:57:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:57:01,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:57:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:57:01,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:57:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:57:01,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:57:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-19 07:57:01,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-19 07:57:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:57:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:57:01,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:57:01,871 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:57:02,094 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:57:02,102 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:57:02,684 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:57:03,292 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:57:03,292 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:57:03,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:57:03 BoogieIcfgContainer [2022-11-19 07:57:03,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:57:03,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:57:03,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:57:03,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:57:03,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:57:00" (1/3) ... [2022-11-19 07:57:03,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7863b09d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:57:03, skipping insertion in model container [2022-11-19 07:57:03,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:01" (2/3) ... [2022-11-19 07:57:03,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7863b09d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:57:03, skipping insertion in model container [2022-11-19 07:57:03,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:57:03" (3/3) ... [2022-11-19 07:57:03,306 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_rmo.i [2022-11-19 07:57:03,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:57:03,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-11-19 07:57:03,330 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:57:03,495 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:57:03,544 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:57:03,567 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 191 transitions, 402 flow [2022-11-19 07:57:03,572 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 191 transitions, 402 flow [2022-11-19 07:57:03,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 191 transitions, 402 flow [2022-11-19 07:57:03,716 INFO L130 PetriNetUnfolder]: 2/187 cut-off events. [2022-11-19 07:57:03,717 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:57:03,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 2/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 200 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-11-19 07:57:03,727 INFO L119 LiptonReduction]: Number of co-enabled transitions 6364 [2022-11-19 07:57:35,041 INFO L134 LiptonReduction]: Checked pairs total: 22166 [2022-11-19 07:57:35,042 INFO L136 LiptonReduction]: Total number of compositions: 177 [2022-11-19 07:57:35,051 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 70 transitions, 160 flow [2022-11-19 07:57:37,266 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 46644 states, 45746 states have (on average 4.390045031259564) internal successors, (200827), 46643 states have internal predecessors, (200827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:37,328 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:57:37,337 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;@11055f71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:57:37,337 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2022-11-19 07:57:37,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 46644 states, 45746 states have (on average 4.390045031259564) internal successors, (200827), 46643 states have internal predecessors, (200827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:57:37,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:57:37,648 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:57:37,656 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:57:37,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:57:37,666 INFO L85 PathProgramCache]: Analyzing trace with hash 895, now seen corresponding path program 1 times [2022-11-19 07:57:37,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:57:37,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519026780] [2022-11-19 07:57:37,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:57:37,680 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-19 07:57:37,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:57:37,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:37,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:57:37,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 07:57:37,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:57:37,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:57:37,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:57:37,899 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:57:37,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519026780] [2022-11-19 07:57:37,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519026780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:57:37,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:57:37,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:57:37,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369749669] [2022-11-19 07:57:37,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:57:37,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:57:37,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:57:37,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:57:37,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:57:38,025 INFO L87 Difference]: Start difference. First operand has 46644 states, 45746 states have (on average 4.390045031259564) internal successors, (200827), 46643 states have internal predecessors, (200827), 0 states have call successors, (0), 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-19 07:57:38,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:57:38,862 INFO L93 Difference]: Finished difference Result 14108 states and 58253 transitions. [2022-11-19 07:57:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:57:38,864 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-19 07:57:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:57:39,239 INFO L225 Difference]: With dead ends: 14108 [2022-11-19 07:57:39,247 INFO L226 Difference]: Without dead ends: 14108 [2022-11-19 07:57:39,248 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-19 07:57:39,253 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:57:39,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:57:39,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14108 states. [2022-11-19 07:57:40,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14108 to 14108. [2022-11-19 07:57:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14108 states, 13974 states have (on average 4.168670387863174) internal successors, (58253), 14107 states have internal predecessors, (58253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14108 states to 14108 states and 58253 transitions. [2022-11-19 07:57:40,311 INFO L78 Accepts]: Start accepts. Automaton has 14108 states and 58253 transitions. Word has length 1 [2022-11-19 07:57:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:57:40,327 INFO L495 AbstractCegarLoop]: Abstraction has 14108 states and 58253 transitions. [2022-11-19 07:57:40,328 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-19 07:57:40,328 INFO L276 IsEmpty]: Start isEmpty. Operand 14108 states and 58253 transitions. [2022-11-19 07:57:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 07:57:40,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:57:40,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 07:57:40,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:40,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:40,540 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:57:40,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:57:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash 881124, now seen corresponding path program 1 times [2022-11-19 07:57:40,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:57:40,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912443758] [2022-11-19 07:57:40,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:57:40,541 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-19 07:57:40,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:57:40,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:40,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:57:40,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:57:40,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:57:40,821 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 07:57:40,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-19 07:57:40,849 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-19 07:57:40,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:57:40,849 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:57:40,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912443758] [2022-11-19 07:57:40,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912443758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:57:40,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:57:40,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:57:40,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749619950] [2022-11-19 07:57:40,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:57:40,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:57:40,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:57:40,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:57:40,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:57:40,853 INFO L87 Difference]: Start difference. First operand 14108 states and 58253 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-19 07:57:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:57:41,411 INFO L93 Difference]: Finished difference Result 8861 states and 35774 transitions. [2022-11-19 07:57:41,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:57:41,415 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-19 07:57:41,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:57:41,491 INFO L225 Difference]: With dead ends: 8861 [2022-11-19 07:57:41,492 INFO L226 Difference]: Without dead ends: 8861 [2022-11-19 07:57:41,492 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-19 07:57:41,493 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:57:41,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 7 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:57:41,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8861 states. [2022-11-19 07:57:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8861 to 8861. [2022-11-19 07:57:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8861 states, 8812 states have (on average 4.059691330004539) internal successors, (35774), 8860 states have internal predecessors, (35774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8861 states to 8861 states and 35774 transitions. [2022-11-19 07:57:41,986 INFO L78 Accepts]: Start accepts. Automaton has 8861 states and 35774 transitions. Word has length 3 [2022-11-19 07:57:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:57:41,987 INFO L495 AbstractCegarLoop]: Abstraction has 8861 states and 35774 transitions. [2022-11-19 07:57:41,987 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-19 07:57:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 8861 states and 35774 transitions. [2022-11-19 07:57:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 07:57:41,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:57:41,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 07:57:42,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:42,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:42,200 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:57:42,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:57:42,201 INFO L85 PathProgramCache]: Analyzing trace with hash 881125, now seen corresponding path program 1 times [2022-11-19 07:57:42,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:57:42,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432917168] [2022-11-19 07:57:42,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:57:42,203 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-19 07:57:42,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:57:42,204 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:42,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:57:42,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 07:57:42,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:57:42,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:57:42,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 07:57:42,432 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-19 07:57:42,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:57:42,432 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:57:42,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432917168] [2022-11-19 07:57:42,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432917168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:57:42,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:57:42,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:57:42,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306988667] [2022-11-19 07:57:42,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:57:42,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:57:42,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:57:42,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:57:42,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:57:42,435 INFO L87 Difference]: Start difference. First operand 8861 states and 35774 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-19 07:57:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:57:42,847 INFO L93 Difference]: Finished difference Result 5598 states and 22127 transitions. [2022-11-19 07:57:42,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:57:42,855 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-19 07:57:42,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:57:42,948 INFO L225 Difference]: With dead ends: 5598 [2022-11-19 07:57:42,948 INFO L226 Difference]: Without dead ends: 5598 [2022-11-19 07:57:42,948 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-19 07:57:42,949 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:57:42,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:57:42,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5598 states. [2022-11-19 07:57:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5598 to 5598. [2022-11-19 07:57:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5598 states, 5580 states have (on average 3.965412186379928) internal successors, (22127), 5597 states have internal predecessors, (22127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:43,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5598 states to 5598 states and 22127 transitions. [2022-11-19 07:57:43,325 INFO L78 Accepts]: Start accepts. Automaton has 5598 states and 22127 transitions. Word has length 3 [2022-11-19 07:57:43,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:57:43,326 INFO L495 AbstractCegarLoop]: Abstraction has 5598 states and 22127 transitions. [2022-11-19 07:57:43,326 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-19 07:57:43,326 INFO L276 IsEmpty]: Start isEmpty. Operand 5598 states and 22127 transitions. [2022-11-19 07:57:43,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:57:43,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:57:43,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:57:43,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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)] Ended with exit code 0 [2022-11-19 07:57:43,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:43,540 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:57:43,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:57:43,540 INFO L85 PathProgramCache]: Analyzing trace with hash 498734331, now seen corresponding path program 1 times [2022-11-19 07:57:43,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:57:43,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312246279] [2022-11-19 07:57:43,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:57:43,541 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-19 07:57:43,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:57:43,548 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:43,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:57:43,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:57:43,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:57:43,835 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-19 07:57:43,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:57:43,836 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:57:43,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312246279] [2022-11-19 07:57:43,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312246279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:57:43,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:57:43,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:57:43,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404757183] [2022-11-19 07:57:43,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:57:43,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:57:43,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:57:43,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:57:43,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:57:43,839 INFO L87 Difference]: Start difference. First operand 5598 states and 22127 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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-19 07:57:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:57:44,067 INFO L93 Difference]: Finished difference Result 3708 states and 12848 transitions. [2022-11-19 07:57:44,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:57:44,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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-19 07:57:44,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:57:44,091 INFO L225 Difference]: With dead ends: 3708 [2022-11-19 07:57:44,092 INFO L226 Difference]: Without dead ends: 3708 [2022-11-19 07:57:44,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-19 07:57:44,093 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:57:44,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 14 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:57:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2022-11-19 07:57:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 3708. [2022-11-19 07:57:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3708 states, 3690 states have (on average 3.481842818428184) internal successors, (12848), 3707 states have internal predecessors, (12848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 12848 transitions. [2022-11-19 07:57:44,255 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 12848 transitions. Word has length 13 [2022-11-19 07:57:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:57:44,256 INFO L495 AbstractCegarLoop]: Abstraction has 3708 states and 12848 transitions. [2022-11-19 07:57:44,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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-19 07:57:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 12848 transitions. [2022-11-19 07:57:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:57:44,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:57:44,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:57:44,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:44,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:44,473 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:57:44,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:57:44,473 INFO L85 PathProgramCache]: Analyzing trace with hash 621765692, now seen corresponding path program 1 times [2022-11-19 07:57:44,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:57:44,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958542488] [2022-11-19 07:57:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:57:44,475 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-19 07:57:44,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:57:44,476 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:44,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:57:44,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:57:44,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:57:44,797 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-19 07:57:44,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:57:44,797 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:57:44,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958542488] [2022-11-19 07:57:44,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958542488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:57:44,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:57:44,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:57:44,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257059550] [2022-11-19 07:57:44,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:57:44,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:57:44,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:57:44,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:57:44,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:57:44,800 INFO L87 Difference]: Start difference. First operand 3708 states and 12848 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-19 07:57:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:57:45,058 INFO L93 Difference]: Finished difference Result 1602 states and 4592 transitions. [2022-11-19 07:57:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:57:45,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-19 07:57:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:57:45,065 INFO L225 Difference]: With dead ends: 1602 [2022-11-19 07:57:45,065 INFO L226 Difference]: Without dead ends: 1602 [2022-11-19 07:57:45,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:57:45,066 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:57:45,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 27 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:57:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2022-11-19 07:57:45,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1602. [2022-11-19 07:57:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1584 states have (on average 2.898989898989899) internal successors, (4592), 1601 states have internal predecessors, (4592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 4592 transitions. [2022-11-19 07:57:45,160 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 4592 transitions. Word has length 16 [2022-11-19 07:57:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:57:45,161 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 4592 transitions. [2022-11-19 07:57:45,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-19 07:57:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 4592 transitions. [2022-11-19 07:57:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 07:57:45,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:57:45,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:57:45,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:45,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:45,364 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:57:45,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:57:45,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1626911555, now seen corresponding path program 1 times [2022-11-19 07:57:45,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:57:45,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784136882] [2022-11-19 07:57:45,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:57:45,366 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-19 07:57:45,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:57:45,367 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:45,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:57:45,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 07:57:45,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:57:45,657 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-19 07:57:45,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:57:45,657 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:57:45,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784136882] [2022-11-19 07:57:45,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784136882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:57:45,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:57:45,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:57:45,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650959184] [2022-11-19 07:57:45,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:57:45,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:57:45,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:57:45,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:57:45,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:57:45,660 INFO L87 Difference]: Start difference. First operand 1602 states and 4592 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:46,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:57:46,037 INFO L93 Difference]: Finished difference Result 738 states and 2055 transitions. [2022-11-19 07:57:46,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:57:46,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-19 07:57:46,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:57:46,040 INFO L225 Difference]: With dead ends: 738 [2022-11-19 07:57:46,041 INFO L226 Difference]: Without dead ends: 738 [2022-11-19 07:57:46,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:57:46,042 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:57:46,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 58 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:57:46,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-11-19 07:57:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2022-11-19 07:57:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 726 states have (on average 2.830578512396694) internal successors, (2055), 737 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 2055 transitions. [2022-11-19 07:57:46,062 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 2055 transitions. Word has length 19 [2022-11-19 07:57:46,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:57:46,063 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 2055 transitions. [2022-11-19 07:57:46,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 2055 transitions. [2022-11-19 07:57:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:57:46,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:57:46,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:57:46,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:46,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:46,284 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:57:46,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:57:46,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1428478209, now seen corresponding path program 1 times [2022-11-19 07:57:46,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:57:46,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758925530] [2022-11-19 07:57:46,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:57:46,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-19 07:57:46,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:57:46,288 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:46,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:57:46,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 07:57:46,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:57:46,590 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-19 07:57:46,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:57:46,590 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:57:46,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758925530] [2022-11-19 07:57:46,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758925530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:57:46,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:57:46,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:57:46,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500494646] [2022-11-19 07:57:46,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:57:46,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:57:46,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:57:46,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:57:46,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:57:46,593 INFO L87 Difference]: Start difference. First operand 738 states and 2055 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:57:47,081 INFO L93 Difference]: Finished difference Result 584 states and 1753 transitions. [2022-11-19 07:57:47,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:57:47,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 07:57:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:57:47,084 INFO L225 Difference]: With dead ends: 584 [2022-11-19 07:57:47,084 INFO L226 Difference]: Without dead ends: 584 [2022-11-19 07:57:47,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:57:47,085 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 48 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:57:47,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 92 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 07:57:47,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-11-19 07:57:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2022-11-19 07:57:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 580 states have (on average 3.0224137931034485) internal successors, (1753), 583 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1753 transitions. [2022-11-19 07:57:47,101 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1753 transitions. Word has length 22 [2022-11-19 07:57:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:57:47,101 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 1753 transitions. [2022-11-19 07:57:47,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1753 transitions. [2022-11-19 07:57:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 07:57:47,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:57:47,104 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] [2022-11-19 07:57:47,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:47,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:47,324 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:57:47,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:57:47,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1518408335, now seen corresponding path program 1 times [2022-11-19 07:57:47,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:57:47,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645351142] [2022-11-19 07:57:47,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:57:47,326 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-19 07:57:47,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:57:47,327 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:47,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:57:47,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:57:47,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:57:48,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2022-11-19 07:57:48,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-19 07:57:48,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-19 07:57:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:57:48,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:57:48,622 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:57:48,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645351142] [2022-11-19 07:57:48,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645351142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:57:48,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:57:48,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:57:48,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261081395] [2022-11-19 07:57:48,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:57:48,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:57:48,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:57:48,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:57:48,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:57:48,625 INFO L87 Difference]: Start difference. First operand 584 states and 1753 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:57:48,847 INFO L93 Difference]: Finished difference Result 583 states and 1752 transitions. [2022-11-19 07:57:48,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:57:48,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-19 07:57:48,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:57:48,851 INFO L225 Difference]: With dead ends: 583 [2022-11-19 07:57:48,851 INFO L226 Difference]: Without dead ends: 583 [2022-11-19 07:57:48,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-19 07:57:48,853 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 32 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:57:48,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 14 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:57:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-11-19 07:57:48,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2022-11-19 07:57:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 580 states have (on average 3.0206896551724136) internal successors, (1752), 582 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 1752 transitions. [2022-11-19 07:57:48,876 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 1752 transitions. Word has length 26 [2022-11-19 07:57:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:57:48,876 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 1752 transitions. [2022-11-19 07:57:48,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 1752 transitions. [2022-11-19 07:57:48,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 07:57:48,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:57:48,879 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] [2022-11-19 07:57:48,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:49,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:49,104 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:57:49,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:57:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1518408336, now seen corresponding path program 1 times [2022-11-19 07:57:49,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:57:49,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872541718] [2022-11-19 07:57:49,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:57:49,107 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-19 07:57:49,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:57:49,108 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:49,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:57:49,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 07:57:49,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:57:50,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-19 07:57:50,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2022-11-19 07:57:50,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-19 07:57:50,317 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:57:50,320 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:57:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:57:50,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:57:50,541 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:57:50,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872541718] [2022-11-19 07:57:50,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872541718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:57:50,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:57:50,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:57:50,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773801859] [2022-11-19 07:57:50,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:57:50,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:57:50,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:57:50,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:57:50,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:57:50,543 INFO L87 Difference]: Start difference. First operand 583 states and 1752 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:57:50,815 INFO L93 Difference]: Finished difference Result 582 states and 1751 transitions. [2022-11-19 07:57:50,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:57:50,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-19 07:57:50,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:57:50,819 INFO L225 Difference]: With dead ends: 582 [2022-11-19 07:57:50,819 INFO L226 Difference]: Without dead ends: 582 [2022-11-19 07:57:50,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:57:50,820 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 63 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:57:50,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 13 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:57:50,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-11-19 07:57:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2022-11-19 07:57:50,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 580 states have (on average 3.018965517241379) internal successors, (1751), 581 states have internal predecessors, (1751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1751 transitions. [2022-11-19 07:57:50,841 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1751 transitions. Word has length 26 [2022-11-19 07:57:50,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:57:50,842 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 1751 transitions. [2022-11-19 07:57:50,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:57:50,842 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1751 transitions. [2022-11-19 07:57:50,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:57:50,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:57:50,845 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] [2022-11-19 07:57:50,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:51,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:51,059 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-19 07:57:51,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:57:51,060 INFO L85 PathProgramCache]: Analyzing trace with hash -173986611, now seen corresponding path program 1 times [2022-11-19 07:57:51,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:57:51,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058475690] [2022-11-19 07:57:51,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:57:51,061 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-19 07:57:51,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:57:51,062 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:51,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:57:51,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:57:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:57:51,641 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-19 07:57:51,642 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:57:51,643 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (55 of 56 remaining) [2022-11-19 07:57:51,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 56 remaining) [2022-11-19 07:57:51,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 56 remaining) [2022-11-19 07:57:51,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 56 remaining) [2022-11-19 07:57:51,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 56 remaining) [2022-11-19 07:57:51,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 56 remaining) [2022-11-19 07:57:51,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 56 remaining) [2022-11-19 07:57:51,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 56 remaining) [2022-11-19 07:57:51,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 56 remaining) [2022-11-19 07:57:51,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 56 remaining) [2022-11-19 07:57:51,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 56 remaining) [2022-11-19 07:57:51,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 56 remaining) [2022-11-19 07:57:51,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 56 remaining) [2022-11-19 07:57:51,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 56 remaining) [2022-11-19 07:57:51,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 56 remaining) [2022-11-19 07:57:51,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 56 remaining) [2022-11-19 07:57:51,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 56 remaining) [2022-11-19 07:57:51,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 56 remaining) [2022-11-19 07:57:51,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 56 remaining) [2022-11-19 07:57:51,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 56 remaining) [2022-11-19 07:57:51,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 56 remaining) [2022-11-19 07:57:51,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 56 remaining) [2022-11-19 07:57:51,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 56 remaining) [2022-11-19 07:57:51,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 56 remaining) [2022-11-19 07:57:51,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 56 remaining) [2022-11-19 07:57:51,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 56 remaining) [2022-11-19 07:57:51,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 56 remaining) [2022-11-19 07:57:51,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 56 remaining) [2022-11-19 07:57:51,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 56 remaining) [2022-11-19 07:57:51,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 56 remaining) [2022-11-19 07:57:51,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 56 remaining) [2022-11-19 07:57:51,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 56 remaining) [2022-11-19 07:57:51,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 56 remaining) [2022-11-19 07:57:51,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (22 of 56 remaining) [2022-11-19 07:57:51,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 56 remaining) [2022-11-19 07:57:51,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 56 remaining) [2022-11-19 07:57:51,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 56 remaining) [2022-11-19 07:57:51,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 56 remaining) [2022-11-19 07:57:51,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 56 remaining) [2022-11-19 07:57:51,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 56 remaining) [2022-11-19 07:57:51,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 56 remaining) [2022-11-19 07:57:51,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 56 remaining) [2022-11-19 07:57:51,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 56 remaining) [2022-11-19 07:57:51,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 56 remaining) [2022-11-19 07:57:51,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 56 remaining) [2022-11-19 07:57:51,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 56 remaining) [2022-11-19 07:57:51,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 56 remaining) [2022-11-19 07:57:51,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 56 remaining) [2022-11-19 07:57:51,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 56 remaining) [2022-11-19 07:57:51,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 56 remaining) [2022-11-19 07:57:51,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 56 remaining) [2022-11-19 07:57:51,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 56 remaining) [2022-11-19 07:57:51,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 56 remaining) [2022-11-19 07:57:51,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 56 remaining) [2022-11-19 07:57:51,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 56 remaining) [2022-11-19 07:57:51,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 56 remaining) [2022-11-19 07:57:51,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:51,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/mathsat -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-19 07:57:51,877 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:57:51,883 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:57:51,884 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:57:52,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:57:52 BasicIcfg [2022-11-19 07:57:52,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:57:52,067 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:57:52,067 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:57:52,067 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:57:52,068 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:57:03" (3/4) ... [2022-11-19 07:57:52,071 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 07:57:52,071 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:57:52,072 INFO L158 Benchmark]: Toolchain (without parser) took 51152.84ms. Allocated memory was 62.9MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 41.9MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-19 07:57:52,072 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 62.9MB. Free memory was 44.2MB in the beginning and 44.2MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:57:52,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 731.51ms. Allocated memory is still 62.9MB. Free memory was 41.7MB in the beginning and 33.7MB in the end (delta: 8.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-19 07:57:52,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.10ms. Allocated memory is still 62.9MB. Free memory was 33.7MB in the beginning and 31.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:57:52,073 INFO L158 Benchmark]: Boogie Preprocessor took 48.30ms. Allocated memory is still 62.9MB. Free memory was 31.0MB in the beginning and 28.7MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:57:52,073 INFO L158 Benchmark]: RCFGBuilder took 1545.08ms. Allocated memory was 62.9MB in the beginning and 90.2MB in the end (delta: 27.3MB). Free memory was 28.7MB in the beginning and 49.9MB in the end (delta: -21.2MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2022-11-19 07:57:52,074 INFO L158 Benchmark]: TraceAbstraction took 48767.89ms. Allocated memory was 90.2MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 49.3MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-19 07:57:52,074 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 2.7GB. Free memory is still 1.6GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:57:52,076 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.26ms. Allocated memory is still 62.9MB. Free memory was 44.2MB in the beginning and 44.2MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 731.51ms. Allocated memory is still 62.9MB. Free memory was 41.7MB in the beginning and 33.7MB in the end (delta: 8.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.10ms. Allocated memory is still 62.9MB. Free memory was 33.7MB in the beginning and 31.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.30ms. Allocated memory is still 62.9MB. Free memory was 31.0MB in the beginning and 28.7MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1545.08ms. Allocated memory was 62.9MB in the beginning and 90.2MB in the end (delta: 27.3MB). Free memory was 28.7MB in the beginning and 49.9MB in the end (delta: -21.2MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * TraceAbstraction took 48767.89ms. Allocated memory was 90.2MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 49.3MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 2.7GB. Free memory is still 1.6GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.5s, 202 PlacesBefore, 82 PlacesAfterwards, 191 TransitionsBefore, 70 TransitionsAfterwards, 6364 CoEnabledTransitionPairs, 8 FixpointIterations, 79 TrivialSequentialCompositions, 91 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 177 TotalNumberOfCompositions, 22166 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10585, independent: 10141, independent conditional: 0, independent unconditional: 10141, dependent: 378, dependent conditional: 0, dependent unconditional: 378, unknown: 66, unknown conditional: 0, unknown unconditional: 66] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4336, independent: 4238, independent conditional: 0, independent unconditional: 4238, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4336, independent: 3980, independent conditional: 0, independent unconditional: 3980, dependent: 356, dependent conditional: 0, dependent unconditional: 356, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 356, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3341, independent: 1604, independent conditional: 0, independent unconditional: 1604, dependent: 1335, dependent conditional: 0, dependent unconditional: 1335, unknown: 402, unknown conditional: 0, unknown unconditional: 402] ], Cache Queries: [ total: 10585, independent: 5903, independent conditional: 0, independent unconditional: 5903, dependent: 290, dependent conditional: 0, dependent unconditional: 290, unknown: 4392, unknown conditional: 0, unknown unconditional: 4392] , Statistics on independence cache: Total cache size (in pairs): 649, Positive cache size: 610, Positive conditional cache size: 0, Positive unconditional cache size: 610, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 6, Unknown conditional cache size: 0, Unknown unconditional cache size: 6 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L757] 0 _Bool a$w_buff1_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L747] 0 _Bool a$r_buff1_thd0; [L711] 0 int __unbuffered_cnt = 0; [L753] 0 int *a$read_delayed_var; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L755] 0 _Bool a$w_buff0_used; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L713] 0 int __unbuffered_p0_EAX = 0; [L741] 0 int a$mem_tmp; [L752] 0 _Bool a$read_delayed; [L733] 0 int __unbuffered_p1_EAX = 0; [L739] 0 int a = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L754] 0 int a$w_buff0; [L756] 0 int a$w_buff1; [L740] 0 _Bool a$flush_delayed; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L759] 0 _Bool main$tmp_guard1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L758] 0 _Bool main$tmp_guard0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L742] 0 _Bool a$r_buff0_thd0; [L737] 0 int __unbuffered_p3_EAX = 0; [L745] 0 _Bool a$r_buff0_thd3; [L744] 0 _Bool a$r_buff0_thd2; [L746] 0 _Bool a$r_buff0_thd4; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L860] 0 pthread_t t2721; [L861] FCALL, FORK 0 pthread_create(&t2721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2721, ((void *)0), P0, ((void *)0))=0, t2721={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L862] 0 pthread_t t2722; [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] EXPR 1 \read(a) [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] 1 a = !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L777] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L778] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L779] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L780] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L781] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L782] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L783] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L784] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L785] EXPR 1 \read(a) [L785] 1 __unbuffered_p0_EAX = a [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] EXPR 1 \read(a) [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] 1 a = a$flush_delayed ? a$mem_tmp : a [L787] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L790] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L795] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 1 return 0; [L863] FCALL, FORK 0 pthread_create(&t2722, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2722, ((void *)0), P1, ((void *)0))=1, t2721={7:0}, t2722={11:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L864] 0 pthread_t t2723; [L802] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L805] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L865] FCALL, FORK 0 pthread_create(&t2723, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2723, ((void *)0), P2, ((void *)0))=2, t2721={7:0}, t2722={11:0}, t2723={14:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L817] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L820] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L866] 0 pthread_t t2724; [L867] FCALL, FORK 0 pthread_create(&t2724, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2724, ((void *)0), P3, ((void *)0))=3, t2721={7:0}, t2722={11:0}, t2723={14:0}, t2724={15:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 a = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 \read(a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 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) [L839] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] 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 [L841] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L871] RET 0 assume_abort_if_not(main$tmp_guard0) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 \read(a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 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) [L874] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] 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 [L876] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] 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 [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2721={7:0}, t2722={11:0}, t2723={14:0}, t2724={15:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=128, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 861]: 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: 863]: 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: 865]: 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, 241 locations, 56 error locations. Started 1 CEGAR loops. OverallTime: 48.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 33.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 278 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 278 mSDsluCounter, 235 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 961 IncrementalHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 91 mSDtfsCounter, 961 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46644occurred in iteration=0, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 555 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1333 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-19 07:57:52,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4a8f932-d269-40b6-ade2-bb67668111a4/bin/utaipan-I9t0OCRTmS/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