./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix006_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d6ef9aa4-6d7f-45d7-afac-8a14cf36a98d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d6ef9aa4-6d7f-45d7-afac-8a14cf36a98d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d6ef9aa4-6d7f-45d7-afac-8a14cf36a98d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d6ef9aa4-6d7f-45d7-afac-8a14cf36a98d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d6ef9aa4-6d7f-45d7-afac-8a14cf36a98d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d6ef9aa4-6d7f-45d7-afac-8a14cf36a98d/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d20aab98319afd33e2a231b3c73d2fc024bfbd81 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:19:15,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:19:15,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:19:15,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:19:15,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:19:15,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:19:15,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:19:15,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:19:15,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:19:15,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:19:15,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:19:15,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:19:15,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:19:15,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:19:15,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:19:15,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:19:15,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:19:15,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:19:15,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:19:15,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:19:15,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:19:15,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:19:15,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:19:15,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:19:15,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:19:15,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:19:15,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:19:15,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:19:15,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:19:15,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:19:15,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:19:15,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:19:15,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:19:15,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:19:15,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:19:15,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:19:15,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:19:15,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:19:15,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:19:15,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:19:15,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:19:15,500 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d6ef9aa4-6d7f-45d7-afac-8a14cf36a98d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:19:15,510 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:19:15,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:19:15,511 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:19:15,511 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:19:15,511 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:19:15,511 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:19:15,511 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:19:15,511 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:19:15,512 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:19:15,512 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:19:15,512 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:19:15,512 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:19:15,512 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:19:15,512 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:19:15,512 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:19:15,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:19:15,513 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:19:15,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:19:15,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:19:15,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:19:15,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:19:15,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:19:15,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:19:15,513 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:19:15,513 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:19:15,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:19:15,514 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:19:15,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:19:15,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:19:15,514 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:19:15,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:19:15,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:19:15,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:19:15,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:19:15,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:19:15,515 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:19:15,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:19:15,515 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:19:15,515 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:19:15,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:19:15,515 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/run_dir_d6ef9aa4-6d7f-45d7-afac-8a14cf36a98d/bin/utaipan 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 ! call(__VERIFIER_error())) ) 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 -> d20aab98319afd33e2a231b3c73d2fc024bfbd81 [2019-12-07 19:19:15,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:19:15,625 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:19:15,628 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:19:15,630 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:19:15,630 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:19:15,631 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d6ef9aa4-6d7f-45d7-afac-8a14cf36a98d/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix006_rmo.oepc.i [2019-12-07 19:19:15,676 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d6ef9aa4-6d7f-45d7-afac-8a14cf36a98d/bin/utaipan/data/f3197af71/cdbfc6c534a4428880bfb8039b841d63/FLAG0c629e2cd [2019-12-07 19:19:16,134 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:19:16,135 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d6ef9aa4-6d7f-45d7-afac-8a14cf36a98d/sv-benchmarks/c/pthread-wmm/mix006_rmo.oepc.i [2019-12-07 19:19:16,147 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d6ef9aa4-6d7f-45d7-afac-8a14cf36a98d/bin/utaipan/data/f3197af71/cdbfc6c534a4428880bfb8039b841d63/FLAG0c629e2cd [2019-12-07 19:19:16,159 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d6ef9aa4-6d7f-45d7-afac-8a14cf36a98d/bin/utaipan/data/f3197af71/cdbfc6c534a4428880bfb8039b841d63 [2019-12-07 19:19:16,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:19:16,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:19:16,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:19:16,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:19:16,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:19:16,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:19:16" (1/1) ... [2019-12-07 19:19:16,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:16, skipping insertion in model container [2019-12-07 19:19:16,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:19:16" (1/1) ... [2019-12-07 19:19:16,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:19:16,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:19:16,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:19:16,461 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:19:16,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:19:16,546 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:19:16,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:16 WrapperNode [2019-12-07 19:19:16,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:19:16,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:19:16,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:19:16,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:19:16,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:16" (1/1) ... [2019-12-07 19:19:16,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:16" (1/1) ... [2019-12-07 19:19:16,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:19:16,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:19:16,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:19:16,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:19:16,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:16" (1/1) ... [2019-12-07 19:19:16,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:16" (1/1) ... [2019-12-07 19:19:16,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:16" (1/1) ... [2019-12-07 19:19:16,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:16" (1/1) ... [2019-12-07 19:19:16,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:16" (1/1) ... [2019-12-07 19:19:16,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:16" (1/1) ... [2019-12-07 19:19:16,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:16" (1/1) ... [2019-12-07 19:19:16,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:19:16,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:19:16,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:19:16,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:19:16,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d6ef9aa4-6d7f-45d7-afac-8a14cf36a98d/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:19:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:19:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:19:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:19:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:19:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:19:16,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:19:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:19:16,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:19:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 19:19:16,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 19:19:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:19:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:19:16,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:19:16,652 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 19:19:17,020 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:19:17,020 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:19:17,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:19:17 BoogieIcfgContainer [2019-12-07 19:19:17,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:19:17,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:19:17,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:19:17,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:19:17,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:19:16" (1/3) ... [2019-12-07 19:19:17,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7177914b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:19:17, skipping insertion in model container [2019-12-07 19:19:17,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:19:16" (2/3) ... [2019-12-07 19:19:17,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7177914b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:19:17, skipping insertion in model container [2019-12-07 19:19:17,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:19:17" (3/3) ... [2019-12-07 19:19:17,026 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_rmo.oepc.i [2019-12-07 19:19:17,032 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:19:17,032 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:19:17,037 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:19:17,038 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:19:17,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,063 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,064 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,064 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,064 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,064 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,068 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,068 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,072 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,073 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:19:17,098 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 19:19:17,110 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:19:17,110 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:19:17,110 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:19:17,110 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:19:17,110 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:19:17,110 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:19:17,110 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:19:17,111 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:19:17,122 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-07 19:19:17,123 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-07 19:19:17,191 INFO L134 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-07 19:19:17,192 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:19:17,204 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 706 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 19:19:17,221 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-07 19:19:17,261 INFO L134 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-07 19:19:17,261 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:19:17,268 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 706 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 19:19:17,284 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 19:19:17,285 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:19:20,341 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-12-07 19:19:20,521 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 19:19:20,610 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78628 [2019-12-07 19:19:20,610 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-07 19:19:20,613 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-07 19:19:34,490 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 110182 states. [2019-12-07 19:19:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 110182 states. [2019-12-07 19:19:34,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 19:19:34,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:19:34,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 19:19:34,496 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:19:34,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:19:34,500 INFO L82 PathProgramCache]: Analyzing trace with hash 917838, now seen corresponding path program 1 times [2019-12-07 19:19:34,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:19:34,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123490031] [2019-12-07 19:19:34,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:19:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:19:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:19:34,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123490031] [2019-12-07 19:19:34,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:19:34,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:19:34,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237202910] [2019-12-07 19:19:34,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:19:34,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:19:34,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:19:34,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:19:34,651 INFO L87 Difference]: Start difference. First operand 110182 states. Second operand 3 states. [2019-12-07 19:19:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:19:35,444 INFO L93 Difference]: Finished difference Result 109312 states and 463550 transitions. [2019-12-07 19:19:35,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:19:35,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 19:19:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:19:36,021 INFO L225 Difference]: With dead ends: 109312 [2019-12-07 19:19:36,021 INFO L226 Difference]: Without dead ends: 102592 [2019-12-07 19:19:36,023 INFO L630 BasicCegarLoop]: 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 [2019-12-07 19:19:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102592 states. [2019-12-07 19:19:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102592 to 102592. [2019-12-07 19:19:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102592 states. [2019-12-07 19:19:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102592 states to 102592 states and 434430 transitions. [2019-12-07 19:19:43,864 INFO L78 Accepts]: Start accepts. Automaton has 102592 states and 434430 transitions. Word has length 3 [2019-12-07 19:19:43,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:19:43,865 INFO L462 AbstractCegarLoop]: Abstraction has 102592 states and 434430 transitions. [2019-12-07 19:19:43,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:19:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 102592 states and 434430 transitions. [2019-12-07 19:19:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:19:43,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:19:43,868 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:19:43,868 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:19:43,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:19:43,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1857942485, now seen corresponding path program 1 times [2019-12-07 19:19:43,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:19:43,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058068647] [2019-12-07 19:19:43,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:19:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:19:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:19:43,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058068647] [2019-12-07 19:19:43,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:19:43,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:19:43,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38434120] [2019-12-07 19:19:43,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:19:43,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:19:43,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:19:43,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:19:43,934 INFO L87 Difference]: Start difference. First operand 102592 states and 434430 transitions. Second operand 4 states. [2019-12-07 19:19:44,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:19:44,737 INFO L93 Difference]: Finished difference Result 159508 states and 648686 transitions. [2019-12-07 19:19:44,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:19:44,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 19:19:44,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:19:45,133 INFO L225 Difference]: With dead ends: 159508 [2019-12-07 19:19:45,133 INFO L226 Difference]: Without dead ends: 159459 [2019-12-07 19:19:45,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:19:50,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159459 states. [2019-12-07 19:19:52,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159459 to 146095. [2019-12-07 19:19:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146095 states. [2019-12-07 19:19:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146095 states to 146095 states and 601450 transitions. [2019-12-07 19:19:52,923 INFO L78 Accepts]: Start accepts. Automaton has 146095 states and 601450 transitions. Word has length 11 [2019-12-07 19:19:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:19:52,923 INFO L462 AbstractCegarLoop]: Abstraction has 146095 states and 601450 transitions. [2019-12-07 19:19:52,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:19:52,923 INFO L276 IsEmpty]: Start isEmpty. Operand 146095 states and 601450 transitions. [2019-12-07 19:19:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:19:52,928 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:19:52,929 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:19:52,929 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:19:52,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:19:52,929 INFO L82 PathProgramCache]: Analyzing trace with hash 230844073, now seen corresponding path program 1 times [2019-12-07 19:19:52,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:19:52,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807624611] [2019-12-07 19:19:52,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:19:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:19:52,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:19:52,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807624611] [2019-12-07 19:19:52,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:19:52,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:19:52,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884554799] [2019-12-07 19:19:52,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:19:52,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:19:52,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:19:52,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:19:52,984 INFO L87 Difference]: Start difference. First operand 146095 states and 601450 transitions. Second operand 4 states. [2019-12-07 19:19:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:19:54,018 INFO L93 Difference]: Finished difference Result 210634 states and 846978 transitions. [2019-12-07 19:19:54,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:19:54,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:19:54,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:19:54,543 INFO L225 Difference]: With dead ends: 210634 [2019-12-07 19:19:54,543 INFO L226 Difference]: Without dead ends: 210578 [2019-12-07 19:19:54,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:20:02,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210578 states. [2019-12-07 19:20:04,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210578 to 176587. [2019-12-07 19:20:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176587 states. [2019-12-07 19:20:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176587 states to 176587 states and 722707 transitions. [2019-12-07 19:20:05,096 INFO L78 Accepts]: Start accepts. Automaton has 176587 states and 722707 transitions. Word has length 13 [2019-12-07 19:20:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:20:05,097 INFO L462 AbstractCegarLoop]: Abstraction has 176587 states and 722707 transitions. [2019-12-07 19:20:05,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:20:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 176587 states and 722707 transitions. [2019-12-07 19:20:05,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 19:20:05,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:20:05,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:20:05,105 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:20:05,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:20:05,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1069845708, now seen corresponding path program 1 times [2019-12-07 19:20:05,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:20:05,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971837803] [2019-12-07 19:20:05,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:20:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:20:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:20:05,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971837803] [2019-12-07 19:20:05,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:20:05,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:20:05,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677428661] [2019-12-07 19:20:05,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:20:05,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:20:05,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:20:05,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:20:05,154 INFO L87 Difference]: Start difference. First operand 176587 states and 722707 transitions. Second operand 4 states. [2019-12-07 19:20:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:20:06,668 INFO L93 Difference]: Finished difference Result 216416 states and 883253 transitions. [2019-12-07 19:20:06,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:20:06,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 19:20:06,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:20:07,258 INFO L225 Difference]: With dead ends: 216416 [2019-12-07 19:20:07,258 INFO L226 Difference]: Without dead ends: 216416 [2019-12-07 19:20:07,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:20:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216416 states. [2019-12-07 19:20:17,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216416 to 185201. [2019-12-07 19:20:17,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185201 states. [2019-12-07 19:20:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185201 states to 185201 states and 759317 transitions. [2019-12-07 19:20:18,501 INFO L78 Accepts]: Start accepts. Automaton has 185201 states and 759317 transitions. Word has length 16 [2019-12-07 19:20:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:20:18,501 INFO L462 AbstractCegarLoop]: Abstraction has 185201 states and 759317 transitions. [2019-12-07 19:20:18,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:20:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 185201 states and 759317 transitions. [2019-12-07 19:20:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:20:18,513 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:20:18,513 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:20:18,513 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:20:18,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:20:18,513 INFO L82 PathProgramCache]: Analyzing trace with hash -430348270, now seen corresponding path program 1 times [2019-12-07 19:20:18,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:20:18,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496460798] [2019-12-07 19:20:18,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:20:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:20:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:20:18,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496460798] [2019-12-07 19:20:18,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:20:18,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:20:18,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800621484] [2019-12-07 19:20:18,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:20:18,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:20:18,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:20:18,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:20:18,588 INFO L87 Difference]: Start difference. First operand 185201 states and 759317 transitions. Second operand 3 states. [2019-12-07 19:20:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:20:19,921 INFO L93 Difference]: Finished difference Result 331864 states and 1351232 transitions. [2019-12-07 19:20:19,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:20:19,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 19:20:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:20:20,657 INFO L225 Difference]: With dead ends: 331864 [2019-12-07 19:20:20,657 INFO L226 Difference]: Without dead ends: 294974 [2019-12-07 19:20:20,658 INFO L630 BasicCegarLoop]: 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 [2019-12-07 19:20:27,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294974 states. [2019-12-07 19:20:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294974 to 282616. [2019-12-07 19:20:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282616 states. [2019-12-07 19:20:35,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282616 states to 282616 states and 1158738 transitions. [2019-12-07 19:20:35,518 INFO L78 Accepts]: Start accepts. Automaton has 282616 states and 1158738 transitions. Word has length 18 [2019-12-07 19:20:35,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:20:35,518 INFO L462 AbstractCegarLoop]: Abstraction has 282616 states and 1158738 transitions. [2019-12-07 19:20:35,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:20:35,518 INFO L276 IsEmpty]: Start isEmpty. Operand 282616 states and 1158738 transitions. [2019-12-07 19:20:35,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:20:35,535 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:20:35,535 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:20:35,535 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:20:35,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:20:35,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1935633602, now seen corresponding path program 1 times [2019-12-07 19:20:35,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:20:35,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064167163] [2019-12-07 19:20:35,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:20:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:20:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:20:35,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064167163] [2019-12-07 19:20:35,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:20:35,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:20:35,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338541301] [2019-12-07 19:20:35,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:20:35,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:20:35,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:20:35,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:20:35,579 INFO L87 Difference]: Start difference. First operand 282616 states and 1158738 transitions. Second operand 5 states. [2019-12-07 19:20:38,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:20:38,197 INFO L93 Difference]: Finished difference Result 395363 states and 1592433 transitions. [2019-12-07 19:20:38,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:20:38,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 19:20:38,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:20:39,254 INFO L225 Difference]: With dead ends: 395363 [2019-12-07 19:20:39,254 INFO L226 Difference]: Without dead ends: 395265 [2019-12-07 19:20:39,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:20:50,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395265 states. [2019-12-07 19:20:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395265 to 301435. [2019-12-07 19:20:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301435 states. [2019-12-07 19:20:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301435 states to 301435 states and 1234907 transitions. [2019-12-07 19:20:56,492 INFO L78 Accepts]: Start accepts. Automaton has 301435 states and 1234907 transitions. Word has length 19 [2019-12-07 19:20:56,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:20:56,493 INFO L462 AbstractCegarLoop]: Abstraction has 301435 states and 1234907 transitions. [2019-12-07 19:20:56,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:20:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 301435 states and 1234907 transitions. [2019-12-07 19:20:56,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:20:56,514 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:20:56,514 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:20:56,514 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:20:56,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:20:56,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1383705760, now seen corresponding path program 1 times [2019-12-07 19:20:56,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:20:56,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544113] [2019-12-07 19:20:56,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:20:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:20:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:20:56,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544113] [2019-12-07 19:20:56,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:20:56,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:20:56,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200626440] [2019-12-07 19:20:56,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:20:56,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:20:56,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:20:56,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:20:56,563 INFO L87 Difference]: Start difference. First operand 301435 states and 1234907 transitions. Second operand 4 states. [2019-12-07 19:20:57,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:20:57,889 INFO L93 Difference]: Finished difference Result 312804 states and 1269857 transitions. [2019-12-07 19:20:57,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:20:57,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 19:20:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:20:59,358 INFO L225 Difference]: With dead ends: 312804 [2019-12-07 19:20:59,358 INFO L226 Difference]: Without dead ends: 312804 [2019-12-07 19:20:59,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:21:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312804 states. [2019-12-07 19:21:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312804 to 297982. [2019-12-07 19:21:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297982 states. [2019-12-07 19:21:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297982 states to 297982 states and 1221729 transitions. [2019-12-07 19:21:15,086 INFO L78 Accepts]: Start accepts. Automaton has 297982 states and 1221729 transitions. Word has length 19 [2019-12-07 19:21:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:15,087 INFO L462 AbstractCegarLoop]: Abstraction has 297982 states and 1221729 transitions. [2019-12-07 19:21:15,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:21:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 297982 states and 1221729 transitions. [2019-12-07 19:21:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:21:15,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:15,108 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:15,108 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:15,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:15,108 INFO L82 PathProgramCache]: Analyzing trace with hash 799446319, now seen corresponding path program 1 times [2019-12-07 19:21:15,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:15,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841464595] [2019-12-07 19:21:15,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:15,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841464595] [2019-12-07 19:21:15,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:15,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:21:15,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570487560] [2019-12-07 19:21:15,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:21:15,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:15,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:21:15,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:21:15,131 INFO L87 Difference]: Start difference. First operand 297982 states and 1221729 transitions. Second operand 3 states. [2019-12-07 19:21:15,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:15,313 INFO L93 Difference]: Finished difference Result 60630 states and 195695 transitions. [2019-12-07 19:21:15,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:21:15,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 19:21:15,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:15,406 INFO L225 Difference]: With dead ends: 60630 [2019-12-07 19:21:15,406 INFO L226 Difference]: Without dead ends: 60630 [2019-12-07 19:21:15,406 INFO L630 BasicCegarLoop]: 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 [2019-12-07 19:21:15,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60630 states. [2019-12-07 19:21:16,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60630 to 60510. [2019-12-07 19:21:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60510 states. [2019-12-07 19:21:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60510 states to 60510 states and 195359 transitions. [2019-12-07 19:21:16,372 INFO L78 Accepts]: Start accepts. Automaton has 60510 states and 195359 transitions. Word has length 19 [2019-12-07 19:21:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:16,373 INFO L462 AbstractCegarLoop]: Abstraction has 60510 states and 195359 transitions. [2019-12-07 19:21:16,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:21:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 60510 states and 195359 transitions. [2019-12-07 19:21:16,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:21:16,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:16,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:16,380 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:16,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:16,380 INFO L82 PathProgramCache]: Analyzing trace with hash 6986775, now seen corresponding path program 1 times [2019-12-07 19:21:16,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:16,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728962753] [2019-12-07 19:21:16,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:16,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728962753] [2019-12-07 19:21:16,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:16,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:21:16,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478015235] [2019-12-07 19:21:16,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:21:16,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:16,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:21:16,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:21:16,851 INFO L87 Difference]: Start difference. First operand 60510 states and 195359 transitions. Second operand 5 states. [2019-12-07 19:21:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:17,335 INFO L93 Difference]: Finished difference Result 78248 states and 248812 transitions. [2019-12-07 19:21:17,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:21:17,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 19:21:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:17,450 INFO L225 Difference]: With dead ends: 78248 [2019-12-07 19:21:17,450 INFO L226 Difference]: Without dead ends: 78241 [2019-12-07 19:21:17,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:21:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78241 states. [2019-12-07 19:21:18,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78241 to 63104. [2019-12-07 19:21:18,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63104 states. [2019-12-07 19:21:18,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63104 states to 63104 states and 202877 transitions. [2019-12-07 19:21:18,600 INFO L78 Accepts]: Start accepts. Automaton has 63104 states and 202877 transitions. Word has length 22 [2019-12-07 19:21:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:18,600 INFO L462 AbstractCegarLoop]: Abstraction has 63104 states and 202877 transitions. [2019-12-07 19:21:18,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:21:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 63104 states and 202877 transitions. [2019-12-07 19:21:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 19:21:18,620 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:18,620 INFO L410 BasicCegarLoop]: 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] [2019-12-07 19:21:18,620 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:18,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:18,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1947963172, now seen corresponding path program 1 times [2019-12-07 19:21:18,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:18,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444559683] [2019-12-07 19:21:18,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:18,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444559683] [2019-12-07 19:21:18,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:18,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:21:18,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346572751] [2019-12-07 19:21:18,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:21:18,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:18,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:21:18,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:21:18,664 INFO L87 Difference]: Start difference. First operand 63104 states and 202877 transitions. Second operand 6 states. [2019-12-07 19:21:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:19,703 INFO L93 Difference]: Finished difference Result 162361 states and 526121 transitions. [2019-12-07 19:21:19,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:21:19,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 19:21:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:19,951 INFO L225 Difference]: With dead ends: 162361 [2019-12-07 19:21:19,952 INFO L226 Difference]: Without dead ends: 162313 [2019-12-07 19:21:19,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:21:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162313 states. [2019-12-07 19:21:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162313 to 90624. [2019-12-07 19:21:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90624 states. [2019-12-07 19:21:22,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90624 states to 90624 states and 296167 transitions. [2019-12-07 19:21:22,211 INFO L78 Accepts]: Start accepts. Automaton has 90624 states and 296167 transitions. Word has length 27 [2019-12-07 19:21:22,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:22,211 INFO L462 AbstractCegarLoop]: Abstraction has 90624 states and 296167 transitions. [2019-12-07 19:21:22,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:21:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 90624 states and 296167 transitions. [2019-12-07 19:21:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 19:21:22,238 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:22,238 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:22,238 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:22,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:22,238 INFO L82 PathProgramCache]: Analyzing trace with hash -89566793, now seen corresponding path program 1 times [2019-12-07 19:21:22,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:22,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568281569] [2019-12-07 19:21:22,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:22,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568281569] [2019-12-07 19:21:22,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:22,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:21:22,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812518305] [2019-12-07 19:21:22,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:21:22,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:22,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:21:22,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:21:22,293 INFO L87 Difference]: Start difference. First operand 90624 states and 296167 transitions. Second operand 6 states. [2019-12-07 19:21:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:23,169 INFO L93 Difference]: Finished difference Result 172788 states and 556735 transitions. [2019-12-07 19:21:23,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:21:23,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-07 19:21:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:23,459 INFO L225 Difference]: With dead ends: 172788 [2019-12-07 19:21:23,460 INFO L226 Difference]: Without dead ends: 172738 [2019-12-07 19:21:23,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:21:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172738 states. [2019-12-07 19:21:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172738 to 93260. [2019-12-07 19:21:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93260 states. [2019-12-07 19:21:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93260 states to 93260 states and 306548 transitions. [2019-12-07 19:21:25,739 INFO L78 Accepts]: Start accepts. Automaton has 93260 states and 306548 transitions. Word has length 28 [2019-12-07 19:21:25,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:25,739 INFO L462 AbstractCegarLoop]: Abstraction has 93260 states and 306548 transitions. [2019-12-07 19:21:25,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:21:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 93260 states and 306548 transitions. [2019-12-07 19:21:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 19:21:25,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:25,772 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:25,772 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:25,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:25,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1908237097, now seen corresponding path program 1 times [2019-12-07 19:21:25,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:25,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506869847] [2019-12-07 19:21:25,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:25,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506869847] [2019-12-07 19:21:25,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:25,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:21:25,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898800820] [2019-12-07 19:21:25,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:21:25,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:25,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:21:25,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:21:25,824 INFO L87 Difference]: Start difference. First operand 93260 states and 306548 transitions. Second operand 5 states. [2019-12-07 19:21:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:26,499 INFO L93 Difference]: Finished difference Result 132664 states and 432154 transitions. [2019-12-07 19:21:26,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:21:26,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 19:21:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:26,723 INFO L225 Difference]: With dead ends: 132664 [2019-12-07 19:21:26,724 INFO L226 Difference]: Without dead ends: 132664 [2019-12-07 19:21:26,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:21:27,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132664 states. [2019-12-07 19:21:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132664 to 113899. [2019-12-07 19:21:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113899 states. [2019-12-07 19:21:28,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113899 states to 113899 states and 373567 transitions. [2019-12-07 19:21:28,948 INFO L78 Accepts]: Start accepts. Automaton has 113899 states and 373567 transitions. Word has length 29 [2019-12-07 19:21:28,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:28,949 INFO L462 AbstractCegarLoop]: Abstraction has 113899 states and 373567 transitions. [2019-12-07 19:21:28,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:21:28,949 INFO L276 IsEmpty]: Start isEmpty. Operand 113899 states and 373567 transitions. [2019-12-07 19:21:28,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 19:21:28,997 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:28,997 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:28,998 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:28,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:28,998 INFO L82 PathProgramCache]: Analyzing trace with hash 157778044, now seen corresponding path program 1 times [2019-12-07 19:21:28,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:28,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823972800] [2019-12-07 19:21:28,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:29,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823972800] [2019-12-07 19:21:29,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:29,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:21:29,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390513541] [2019-12-07 19:21:29,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:21:29,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:29,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:21:29,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:21:29,052 INFO L87 Difference]: Start difference. First operand 113899 states and 373567 transitions. Second operand 5 states. [2019-12-07 19:21:30,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:30,008 INFO L93 Difference]: Finished difference Result 153267 states and 497640 transitions. [2019-12-07 19:21:30,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:21:30,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 19:21:30,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:30,250 INFO L225 Difference]: With dead ends: 153267 [2019-12-07 19:21:30,250 INFO L226 Difference]: Without dead ends: 153260 [2019-12-07 19:21:30,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:21:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153260 states. [2019-12-07 19:21:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153260 to 122934. [2019-12-07 19:21:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122934 states. [2019-12-07 19:21:32,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122934 states to 122934 states and 403203 transitions. [2019-12-07 19:21:32,749 INFO L78 Accepts]: Start accepts. Automaton has 122934 states and 403203 transitions. Word has length 30 [2019-12-07 19:21:32,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:32,750 INFO L462 AbstractCegarLoop]: Abstraction has 122934 states and 403203 transitions. [2019-12-07 19:21:32,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:21:32,750 INFO L276 IsEmpty]: Start isEmpty. Operand 122934 states and 403203 transitions. [2019-12-07 19:21:32,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 19:21:32,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:32,806 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:32,806 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:32,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:32,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1971705495, now seen corresponding path program 1 times [2019-12-07 19:21:32,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:32,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59850970] [2019-12-07 19:21:32,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:32,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59850970] [2019-12-07 19:21:32,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:32,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:21:32,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534079855] [2019-12-07 19:21:32,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:21:32,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:32,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:21:32,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:21:32,840 INFO L87 Difference]: Start difference. First operand 122934 states and 403203 transitions. Second operand 3 states. [2019-12-07 19:21:33,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:33,339 INFO L93 Difference]: Finished difference Result 174287 states and 571340 transitions. [2019-12-07 19:21:33,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:21:33,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 19:21:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:33,450 INFO L225 Difference]: With dead ends: 174287 [2019-12-07 19:21:33,450 INFO L226 Difference]: Without dead ends: 68588 [2019-12-07 19:21:33,451 INFO L630 BasicCegarLoop]: 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 [2019-12-07 19:21:33,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68588 states. [2019-12-07 19:21:34,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68588 to 64943. [2019-12-07 19:21:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64943 states. [2019-12-07 19:21:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64943 states to 64943 states and 209205 transitions. [2019-12-07 19:21:34,530 INFO L78 Accepts]: Start accepts. Automaton has 64943 states and 209205 transitions. Word has length 30 [2019-12-07 19:21:34,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:34,530 INFO L462 AbstractCegarLoop]: Abstraction has 64943 states and 209205 transitions. [2019-12-07 19:21:34,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:21:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 64943 states and 209205 transitions. [2019-12-07 19:21:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 19:21:34,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:34,555 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:34,556 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:34,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:34,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1634874221, now seen corresponding path program 1 times [2019-12-07 19:21:34,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:34,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079829198] [2019-12-07 19:21:34,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:34,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079829198] [2019-12-07 19:21:34,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:34,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:21:34,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806349954] [2019-12-07 19:21:34,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:21:34,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:34,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:21:34,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:21:34,585 INFO L87 Difference]: Start difference. First operand 64943 states and 209205 transitions. Second operand 4 states. [2019-12-07 19:21:34,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:34,744 INFO L93 Difference]: Finished difference Result 30000 states and 91694 transitions. [2019-12-07 19:21:34,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:21:34,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-07 19:21:34,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:34,782 INFO L225 Difference]: With dead ends: 30000 [2019-12-07 19:21:34,782 INFO L226 Difference]: Without dead ends: 30000 [2019-12-07 19:21:34,783 INFO L630 BasicCegarLoop]: 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 [2019-12-07 19:21:34,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30000 states. [2019-12-07 19:21:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30000 to 28417. [2019-12-07 19:21:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28417 states. [2019-12-07 19:21:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28417 states to 28417 states and 87446 transitions. [2019-12-07 19:21:35,205 INFO L78 Accepts]: Start accepts. Automaton has 28417 states and 87446 transitions. Word has length 31 [2019-12-07 19:21:35,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:35,205 INFO L462 AbstractCegarLoop]: Abstraction has 28417 states and 87446 transitions. [2019-12-07 19:21:35,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:21:35,205 INFO L276 IsEmpty]: Start isEmpty. Operand 28417 states and 87446 transitions. [2019-12-07 19:21:35,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 19:21:35,225 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:35,225 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:35,225 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:35,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:35,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1720610055, now seen corresponding path program 1 times [2019-12-07 19:21:35,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:35,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663085405] [2019-12-07 19:21:35,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:35,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663085405] [2019-12-07 19:21:35,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:35,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:21:35,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462423104] [2019-12-07 19:21:35,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:21:35,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:35,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:21:35,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:21:35,283 INFO L87 Difference]: Start difference. First operand 28417 states and 87446 transitions. Second operand 7 states. [2019-12-07 19:21:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:36,122 INFO L93 Difference]: Finished difference Result 62909 states and 189256 transitions. [2019-12-07 19:21:36,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 19:21:36,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 19:21:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:36,203 INFO L225 Difference]: With dead ends: 62909 [2019-12-07 19:21:36,203 INFO L226 Difference]: Without dead ends: 62909 [2019-12-07 19:21:36,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-07 19:21:36,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62909 states. [2019-12-07 19:21:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62909 to 30363. [2019-12-07 19:21:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30363 states. [2019-12-07 19:21:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30363 states to 30363 states and 93252 transitions. [2019-12-07 19:21:36,869 INFO L78 Accepts]: Start accepts. Automaton has 30363 states and 93252 transitions. Word has length 33 [2019-12-07 19:21:36,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:36,869 INFO L462 AbstractCegarLoop]: Abstraction has 30363 states and 93252 transitions. [2019-12-07 19:21:36,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:21:36,869 INFO L276 IsEmpty]: Start isEmpty. Operand 30363 states and 93252 transitions. [2019-12-07 19:21:36,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 19:21:36,890 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:36,890 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:36,890 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:36,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:36,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1518720007, now seen corresponding path program 2 times [2019-12-07 19:21:36,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:36,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721597243] [2019-12-07 19:21:36,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:36,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721597243] [2019-12-07 19:21:36,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:36,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:21:36,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132846743] [2019-12-07 19:21:36,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:21:36,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:36,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:21:36,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:21:36,956 INFO L87 Difference]: Start difference. First operand 30363 states and 93252 transitions. Second operand 8 states. [2019-12-07 19:21:38,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:38,214 INFO L93 Difference]: Finished difference Result 102195 states and 301533 transitions. [2019-12-07 19:21:38,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 19:21:38,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-07 19:21:38,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:38,357 INFO L225 Difference]: With dead ends: 102195 [2019-12-07 19:21:38,358 INFO L226 Difference]: Without dead ends: 102195 [2019-12-07 19:21:38,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2019-12-07 19:21:38,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102195 states. [2019-12-07 19:21:39,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102195 to 31177. [2019-12-07 19:21:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31177 states. [2019-12-07 19:21:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31177 states to 31177 states and 95708 transitions. [2019-12-07 19:21:39,324 INFO L78 Accepts]: Start accepts. Automaton has 31177 states and 95708 transitions. Word has length 33 [2019-12-07 19:21:39,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:39,324 INFO L462 AbstractCegarLoop]: Abstraction has 31177 states and 95708 transitions. [2019-12-07 19:21:39,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:21:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 31177 states and 95708 transitions. [2019-12-07 19:21:39,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 19:21:39,347 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:39,347 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:39,348 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:39,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:39,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2146187134, now seen corresponding path program 1 times [2019-12-07 19:21:39,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:39,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676687242] [2019-12-07 19:21:39,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:39,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676687242] [2019-12-07 19:21:39,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:39,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:21:39,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582922072] [2019-12-07 19:21:39,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:21:39,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:39,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:21:39,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:21:39,407 INFO L87 Difference]: Start difference. First operand 31177 states and 95708 transitions. Second operand 7 states. [2019-12-07 19:21:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:40,498 INFO L93 Difference]: Finished difference Result 61466 states and 183355 transitions. [2019-12-07 19:21:40,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 19:21:40,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-07 19:21:40,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:40,590 INFO L225 Difference]: With dead ends: 61466 [2019-12-07 19:21:40,590 INFO L226 Difference]: Without dead ends: 61466 [2019-12-07 19:21:40,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-07 19:21:40,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61466 states. [2019-12-07 19:21:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61466 to 29134. [2019-12-07 19:21:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29134 states. [2019-12-07 19:21:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29134 states to 29134 states and 89389 transitions. [2019-12-07 19:21:41,248 INFO L78 Accepts]: Start accepts. Automaton has 29134 states and 89389 transitions. Word has length 34 [2019-12-07 19:21:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:41,248 INFO L462 AbstractCegarLoop]: Abstraction has 29134 states and 89389 transitions. [2019-12-07 19:21:41,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:21:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 29134 states and 89389 transitions. [2019-12-07 19:21:41,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 19:21:41,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:41,270 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:41,270 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:41,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:41,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1401085166, now seen corresponding path program 2 times [2019-12-07 19:21:41,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:41,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968882625] [2019-12-07 19:21:41,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:41,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968882625] [2019-12-07 19:21:41,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:41,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:21:41,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688218438] [2019-12-07 19:21:41,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:21:41,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:41,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:21:41,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:21:41,347 INFO L87 Difference]: Start difference. First operand 29134 states and 89389 transitions. Second operand 8 states. [2019-12-07 19:21:42,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:42,927 INFO L93 Difference]: Finished difference Result 76861 states and 227010 transitions. [2019-12-07 19:21:42,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 19:21:42,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-07 19:21:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:43,028 INFO L225 Difference]: With dead ends: 76861 [2019-12-07 19:21:43,028 INFO L226 Difference]: Without dead ends: 76861 [2019-12-07 19:21:43,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2019-12-07 19:21:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76861 states. [2019-12-07 19:21:43,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76861 to 28884. [2019-12-07 19:21:43,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28884 states. [2019-12-07 19:21:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28884 states to 28884 states and 88648 transitions. [2019-12-07 19:21:43,802 INFO L78 Accepts]: Start accepts. Automaton has 28884 states and 88648 transitions. Word has length 34 [2019-12-07 19:21:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:43,802 INFO L462 AbstractCegarLoop]: Abstraction has 28884 states and 88648 transitions. [2019-12-07 19:21:43,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:21:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 28884 states and 88648 transitions. [2019-12-07 19:21:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 19:21:43,830 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:43,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:43,831 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:43,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:43,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1944149328, now seen corresponding path program 1 times [2019-12-07 19:21:43,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:43,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397351572] [2019-12-07 19:21:43,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:43,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397351572] [2019-12-07 19:21:43,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:43,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:21:43,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490313846] [2019-12-07 19:21:43,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:21:43,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:43,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:21:43,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:21:43,871 INFO L87 Difference]: Start difference. First operand 28884 states and 88648 transitions. Second operand 3 states. [2019-12-07 19:21:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:43,953 INFO L93 Difference]: Finished difference Result 28884 states and 88556 transitions. [2019-12-07 19:21:43,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:21:43,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 19:21:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:43,989 INFO L225 Difference]: With dead ends: 28884 [2019-12-07 19:21:43,989 INFO L226 Difference]: Without dead ends: 28884 [2019-12-07 19:21:43,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:21:44,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28884 states. [2019-12-07 19:21:44,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28884 to 22775. [2019-12-07 19:21:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22775 states. [2019-12-07 19:21:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22775 states to 22775 states and 70854 transitions. [2019-12-07 19:21:44,367 INFO L78 Accepts]: Start accepts. Automaton has 22775 states and 70854 transitions. Word has length 40 [2019-12-07 19:21:44,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:44,368 INFO L462 AbstractCegarLoop]: Abstraction has 22775 states and 70854 transitions. [2019-12-07 19:21:44,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:21:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 22775 states and 70854 transitions. [2019-12-07 19:21:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 19:21:44,390 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:44,390 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:44,390 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:44,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:44,390 INFO L82 PathProgramCache]: Analyzing trace with hash -798917120, now seen corresponding path program 1 times [2019-12-07 19:21:44,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:44,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393802333] [2019-12-07 19:21:44,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:44,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393802333] [2019-12-07 19:21:44,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:44,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:21:44,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550138905] [2019-12-07 19:21:44,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:21:44,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:44,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:21:44,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:21:44,421 INFO L87 Difference]: Start difference. First operand 22775 states and 70854 transitions. Second operand 3 states. [2019-12-07 19:21:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:44,478 INFO L93 Difference]: Finished difference Result 18128 states and 55427 transitions. [2019-12-07 19:21:44,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:21:44,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 19:21:44,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:44,499 INFO L225 Difference]: With dead ends: 18128 [2019-12-07 19:21:44,499 INFO L226 Difference]: Without dead ends: 18128 [2019-12-07 19:21:44,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:21:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18128 states. [2019-12-07 19:21:44,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18128 to 17642. [2019-12-07 19:21:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-07 19:21:44,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 54060 transitions. [2019-12-07 19:21:44,753 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 54060 transitions. Word has length 41 [2019-12-07 19:21:44,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:44,754 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 54060 transitions. [2019-12-07 19:21:44,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:21:44,754 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 54060 transitions. [2019-12-07 19:21:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 19:21:44,770 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:44,770 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:44,771 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:44,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:44,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2136621759, now seen corresponding path program 1 times [2019-12-07 19:21:44,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:44,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19679955] [2019-12-07 19:21:44,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:44,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19679955] [2019-12-07 19:21:44,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:44,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:21:44,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996173161] [2019-12-07 19:21:44,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:21:44,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:44,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:21:44,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:21:44,807 INFO L87 Difference]: Start difference. First operand 17642 states and 54060 transitions. Second operand 5 states. [2019-12-07 19:21:44,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:44,860 INFO L93 Difference]: Finished difference Result 16402 states and 51289 transitions. [2019-12-07 19:21:44,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:21:44,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 19:21:44,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:44,884 INFO L225 Difference]: With dead ends: 16402 [2019-12-07 19:21:44,884 INFO L226 Difference]: Without dead ends: 14855 [2019-12-07 19:21:44,884 INFO L630 BasicCegarLoop]: 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 [2019-12-07 19:21:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14855 states. [2019-12-07 19:21:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14855 to 14855. [2019-12-07 19:21:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14855 states. [2019-12-07 19:21:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14855 states to 14855 states and 47406 transitions. [2019-12-07 19:21:45,100 INFO L78 Accepts]: Start accepts. Automaton has 14855 states and 47406 transitions. Word has length 42 [2019-12-07 19:21:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:45,100 INFO L462 AbstractCegarLoop]: Abstraction has 14855 states and 47406 transitions. [2019-12-07 19:21:45,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:21:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 14855 states and 47406 transitions. [2019-12-07 19:21:45,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 19:21:45,114 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:45,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:45,114 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:45,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:45,114 INFO L82 PathProgramCache]: Analyzing trace with hash 605202275, now seen corresponding path program 1 times [2019-12-07 19:21:45,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:45,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768194772] [2019-12-07 19:21:45,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:45,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768194772] [2019-12-07 19:21:45,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:45,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:21:45,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576805701] [2019-12-07 19:21:45,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:21:45,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:45,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:21:45,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:21:45,151 INFO L87 Difference]: Start difference. First operand 14855 states and 47406 transitions. Second operand 3 states. [2019-12-07 19:21:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:21:45,222 INFO L93 Difference]: Finished difference Result 18621 states and 59113 transitions. [2019-12-07 19:21:45,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:21:45,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 19:21:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:21:45,277 INFO L225 Difference]: With dead ends: 18621 [2019-12-07 19:21:45,277 INFO L226 Difference]: Without dead ends: 18621 [2019-12-07 19:21:45,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:21:45,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18621 states. [2019-12-07 19:21:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18621 to 12985. [2019-12-07 19:21:45,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12985 states. [2019-12-07 19:21:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12985 states to 12985 states and 41043 transitions. [2019-12-07 19:21:45,488 INFO L78 Accepts]: Start accepts. Automaton has 12985 states and 41043 transitions. Word has length 66 [2019-12-07 19:21:45,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:21:45,489 INFO L462 AbstractCegarLoop]: Abstraction has 12985 states and 41043 transitions. [2019-12-07 19:21:45,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:21:45,489 INFO L276 IsEmpty]: Start isEmpty. Operand 12985 states and 41043 transitions. [2019-12-07 19:21:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 19:21:45,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:21:45,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:21:45,501 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:21:45,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:21:45,501 INFO L82 PathProgramCache]: Analyzing trace with hash -574262541, now seen corresponding path program 1 times [2019-12-07 19:21:45,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:21:45,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472089629] [2019-12-07 19:21:45,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:21:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:21:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:21:45,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472089629] [2019-12-07 19:21:45,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:21:45,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 19:21:45,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144897818] [2019-12-07 19:21:45,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 19:21:45,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:21:45,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 19:21:45,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:21:45,750 INFO L87 Difference]: Start difference. First operand 12985 states and 41043 transitions. Second operand 14 states. [2019-12-07 19:21:48,324 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-12-07 19:21:48,666 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-12-07 19:21:49,850 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-12-07 19:21:50,511 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-12-07 19:21:50,862 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-12-07 19:21:51,285 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-12-07 19:21:52,064 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-12-07 19:21:57,806 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-07 19:21:58,002 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-12-07 19:22:01,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:01,023 INFO L93 Difference]: Finished difference Result 115070 states and 354738 transitions. [2019-12-07 19:22:01,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-12-07 19:22:01,024 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-07 19:22:01,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:01,139 INFO L225 Difference]: With dead ends: 115070 [2019-12-07 19:22:01,139 INFO L226 Difference]: Without dead ends: 88295 [2019-12-07 19:22:01,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8427 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=2948, Invalid=17644, Unknown=0, NotChecked=0, Total=20592 [2019-12-07 19:22:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88295 states. [2019-12-07 19:22:01,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88295 to 22685. [2019-12-07 19:22:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22685 states. [2019-12-07 19:22:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22685 states to 22685 states and 72166 transitions. [2019-12-07 19:22:02,004 INFO L78 Accepts]: Start accepts. Automaton has 22685 states and 72166 transitions. Word has length 67 [2019-12-07 19:22:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:02,005 INFO L462 AbstractCegarLoop]: Abstraction has 22685 states and 72166 transitions. [2019-12-07 19:22:02,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 19:22:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 22685 states and 72166 transitions. [2019-12-07 19:22:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 19:22:02,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:02,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:02,028 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash 603749179, now seen corresponding path program 1 times [2019-12-07 19:22:02,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:02,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683590630] [2019-12-07 19:22:02,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:02,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683590630] [2019-12-07 19:22:02,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:02,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:22:02,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490658815] [2019-12-07 19:22:02,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:22:02,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:02,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:22:02,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:22:02,099 INFO L87 Difference]: Start difference. First operand 22685 states and 72166 transitions. Second operand 7 states. [2019-12-07 19:22:03,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:03,010 INFO L93 Difference]: Finished difference Result 45438 states and 141009 transitions. [2019-12-07 19:22:03,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 19:22:03,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-07 19:22:03,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:03,066 INFO L225 Difference]: With dead ends: 45438 [2019-12-07 19:22:03,067 INFO L226 Difference]: Without dead ends: 45438 [2019-12-07 19:22:03,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-07 19:22:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45438 states. [2019-12-07 19:22:03,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45438 to 23784. [2019-12-07 19:22:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23784 states. [2019-12-07 19:22:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23784 states to 23784 states and 75410 transitions. [2019-12-07 19:22:03,638 INFO L78 Accepts]: Start accepts. Automaton has 23784 states and 75410 transitions. Word has length 67 [2019-12-07 19:22:03,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:03,638 INFO L462 AbstractCegarLoop]: Abstraction has 23784 states and 75410 transitions. [2019-12-07 19:22:03,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:22:03,638 INFO L276 IsEmpty]: Start isEmpty. Operand 23784 states and 75410 transitions. [2019-12-07 19:22:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 19:22:03,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:03,661 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:03,661 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:03,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:03,661 INFO L82 PathProgramCache]: Analyzing trace with hash 795565329, now seen corresponding path program 2 times [2019-12-07 19:22:03,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:03,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579922685] [2019-12-07 19:22:03,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:03,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579922685] [2019-12-07 19:22:03,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:03,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:22:03,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536196498] [2019-12-07 19:22:03,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:22:03,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:03,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:22:03,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:22:03,702 INFO L87 Difference]: Start difference. First operand 23784 states and 75410 transitions. Second operand 4 states. [2019-12-07 19:22:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:03,819 INFO L93 Difference]: Finished difference Result 27921 states and 88132 transitions. [2019-12-07 19:22:03,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:22:03,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 19:22:03,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:03,854 INFO L225 Difference]: With dead ends: 27921 [2019-12-07 19:22:03,854 INFO L226 Difference]: Without dead ends: 27921 [2019-12-07 19:22:03,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:22:03,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27921 states. [2019-12-07 19:22:04,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27921 to 22029. [2019-12-07 19:22:04,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22029 states. [2019-12-07 19:22:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22029 states to 22029 states and 70130 transitions. [2019-12-07 19:22:04,239 INFO L78 Accepts]: Start accepts. Automaton has 22029 states and 70130 transitions. Word has length 67 [2019-12-07 19:22:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:04,239 INFO L462 AbstractCegarLoop]: Abstraction has 22029 states and 70130 transitions. [2019-12-07 19:22:04,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:22:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 22029 states and 70130 transitions. [2019-12-07 19:22:04,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 19:22:04,259 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:04,259 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:04,259 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:04,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:04,259 INFO L82 PathProgramCache]: Analyzing trace with hash 735265803, now seen corresponding path program 2 times [2019-12-07 19:22:04,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:04,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512381843] [2019-12-07 19:22:04,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:04,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512381843] [2019-12-07 19:22:04,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:04,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:22:04,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014056472] [2019-12-07 19:22:04,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:22:04,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:04,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:22:04,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:22:04,369 INFO L87 Difference]: Start difference. First operand 22029 states and 70130 transitions. Second operand 9 states. [2019-12-07 19:22:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:06,875 INFO L93 Difference]: Finished difference Result 102401 states and 317940 transitions. [2019-12-07 19:22:06,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-07 19:22:06,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-07 19:22:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:06,994 INFO L225 Difference]: With dead ends: 102401 [2019-12-07 19:22:06,994 INFO L226 Difference]: Without dead ends: 90974 [2019-12-07 19:22:06,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=564, Invalid=1886, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 19:22:07,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90974 states. [2019-12-07 19:22:07,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90974 to 22251. [2019-12-07 19:22:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22251 states. [2019-12-07 19:22:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22251 states to 22251 states and 70940 transitions. [2019-12-07 19:22:07,939 INFO L78 Accepts]: Start accepts. Automaton has 22251 states and 70940 transitions. Word has length 67 [2019-12-07 19:22:07,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:07,940 INFO L462 AbstractCegarLoop]: Abstraction has 22251 states and 70940 transitions. [2019-12-07 19:22:07,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:22:07,940 INFO L276 IsEmpty]: Start isEmpty. Operand 22251 states and 70940 transitions. [2019-12-07 19:22:07,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 19:22:07,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:07,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:07,957 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:07,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:07,957 INFO L82 PathProgramCache]: Analyzing trace with hash 370283376, now seen corresponding path program 1 times [2019-12-07 19:22:07,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:07,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592639662] [2019-12-07 19:22:07,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:07,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592639662] [2019-12-07 19:22:07,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:07,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:22:07,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652702849] [2019-12-07 19:22:07,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:22:07,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:07,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:22:07,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:07,982 INFO L87 Difference]: Start difference. First operand 22251 states and 70940 transitions. Second operand 3 states. [2019-12-07 19:22:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:08,056 INFO L93 Difference]: Finished difference Result 25514 states and 79733 transitions. [2019-12-07 19:22:08,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:22:08,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 19:22:08,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:08,087 INFO L225 Difference]: With dead ends: 25514 [2019-12-07 19:22:08,088 INFO L226 Difference]: Without dead ends: 25004 [2019-12-07 19:22:08,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25004 states. [2019-12-07 19:22:08,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25004 to 20679. [2019-12-07 19:22:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20679 states. [2019-12-07 19:22:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20679 states to 20679 states and 65497 transitions. [2019-12-07 19:22:08,417 INFO L78 Accepts]: Start accepts. Automaton has 20679 states and 65497 transitions. Word has length 67 [2019-12-07 19:22:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:08,418 INFO L462 AbstractCegarLoop]: Abstraction has 20679 states and 65497 transitions. [2019-12-07 19:22:08,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:22:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 20679 states and 65497 transitions. [2019-12-07 19:22:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 19:22:08,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:08,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:08,435 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:08,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:08,435 INFO L82 PathProgramCache]: Analyzing trace with hash 516538099, now seen corresponding path program 3 times [2019-12-07 19:22:08,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:08,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375556258] [2019-12-07 19:22:08,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:08,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375556258] [2019-12-07 19:22:08,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:08,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:22:08,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025254941] [2019-12-07 19:22:08,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:22:08,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:08,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:22:08,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:22:08,511 INFO L87 Difference]: Start difference. First operand 20679 states and 65497 transitions. Second operand 9 states. [2019-12-07 19:22:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:09,591 INFO L93 Difference]: Finished difference Result 107446 states and 325867 transitions. [2019-12-07 19:22:09,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 19:22:09,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-07 19:22:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:09,687 INFO L225 Difference]: With dead ends: 107446 [2019-12-07 19:22:09,687 INFO L226 Difference]: Without dead ends: 77224 [2019-12-07 19:22:09,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=423, Invalid=1299, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 19:22:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77224 states. [2019-12-07 19:22:10,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77224 to 22291. [2019-12-07 19:22:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22291 states. [2019-12-07 19:22:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22291 states to 22291 states and 69952 transitions. [2019-12-07 19:22:10,413 INFO L78 Accepts]: Start accepts. Automaton has 22291 states and 69952 transitions. Word has length 67 [2019-12-07 19:22:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:10,413 INFO L462 AbstractCegarLoop]: Abstraction has 22291 states and 69952 transitions. [2019-12-07 19:22:10,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:22:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 22291 states and 69952 transitions. [2019-12-07 19:22:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 19:22:10,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:10,435 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:10,435 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:10,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:10,435 INFO L82 PathProgramCache]: Analyzing trace with hash 763340387, now seen corresponding path program 4 times [2019-12-07 19:22:10,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:10,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361394399] [2019-12-07 19:22:10,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:22:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:22:10,508 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:22:10,508 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:22:10,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~z$r_buff0_thd3~0_367) (= v_~z$r_buff0_thd0~0_147 0) (= v_~z$w_buff0_used~0_850 0) (= v_~z$w_buff0~0_393 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_322) (= v_~weak$$choice2~0_147 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t165~0.base_27|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd1~0_158 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t165~0.base_27| 4)) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_168 0) (= v_~z$w_buff1_used~0_568 0) (= v_~main$tmp_guard1~0_41 0) (= |v_ULTIMATE.start_main_~#t165~0.offset_17| 0) (= 0 v_~__unbuffered_p2_EAX~0_41) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_26) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= v_~z$r_buff0_thd1~0_210 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t165~0.base_27| 1)) (= 0 v_~x~0_154) (= v_~z$r_buff0_thd2~0_129 0) (= 0 v_~__unbuffered_cnt~0_88) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t165~0.base_27| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t165~0.base_27|) |v_ULTIMATE.start_main_~#t165~0.offset_17| 0)) |v_#memory_int_19|) (= v_~z~0_181 0) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t165~0.base_27|)) (= v_~y~0_31 0) (= v_~z$r_buff1_thd0~0_191 0) (= v_~z$w_buff1~0_253 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_168, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_61|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_191|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ULTIMATE.start_main_~#t167~0.offset=|v_ULTIMATE.start_main_~#t167~0.offset_17|, ULTIMATE.start_main_~#t166~0.offset=|v_ULTIMATE.start_main_~#t166~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_568, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ULTIMATE.start_main_~#t165~0.base=|v_ULTIMATE.start_main_~#t165~0.base_27|, ~weak$$choice0~0=v_~weak$$choice0~0_13, ULTIMATE.start_main_~#t165~0.offset=|v_ULTIMATE.start_main_~#t165~0.offset_17|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t166~0.base=|v_ULTIMATE.start_main_~#t166~0.base_22|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_158, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_367, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~x~0=v_~x~0_154, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_253, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_39|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_191, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_129, ULTIMATE.start_main_~#t167~0.base=|v_ULTIMATE.start_main_~#t167~0.base_23|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_850, ~z$w_buff0~0=v_~z$w_buff0~0_393, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_322, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_210} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t167~0.offset, ULTIMATE.start_main_~#t166~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t165~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t165~0.offset, ULTIMATE.start_main_~#t166~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t167~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:22:10,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L830-1-->L832: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t166~0.base_11| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t166~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t166~0.base_11|) |v_ULTIMATE.start_main_~#t166~0.offset_9| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t166~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t166~0.base_11|) (= |v_ULTIMATE.start_main_~#t166~0.offset_9| 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t166~0.base_11| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t166~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t166~0.offset=|v_ULTIMATE.start_main_~#t166~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t166~0.base=|v_ULTIMATE.start_main_~#t166~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t166~0.offset, ULTIMATE.start_main_~#t166~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 19:22:10,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= v_~z$r_buff0_thd0~0_17 v_~z$r_buff1_thd0~0_13) (= 1 v_~x~0_6) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_4)) (= v_~z$r_buff0_thd1~0_21 1) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_31) (= v_~z$r_buff0_thd1~0_22 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_4, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_31, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_13, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_4, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_21, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 19:22:10,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In2013993993 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In2013993993 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out2013993993| ~z~0_In2013993993) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out2013993993| ~z$w_buff1~0_In2013993993) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2013993993, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2013993993, ~z$w_buff1~0=~z$w_buff1~0_In2013993993, ~z~0=~z~0_In2013993993} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out2013993993|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2013993993, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2013993993, ~z$w_buff1~0=~z$w_buff1~0_In2013993993, ~z~0=~z~0_In2013993993} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 19:22:10,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_10| v_~z~0_27) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_10|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_9|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_15|, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-07 19:22:10,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-1107750427 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1107750427 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1107750427| ~z$w_buff0_used~0_In-1107750427)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1107750427| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1107750427, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1107750427} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1107750427, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1107750427|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1107750427} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 19:22:10,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-81912080 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-81912080 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-81912080 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-81912080 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-81912080|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out-81912080| ~z$w_buff1_used~0_In-81912080) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-81912080, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-81912080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-81912080, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-81912080} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-81912080, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-81912080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-81912080, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-81912080|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-81912080} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 19:22:10,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t167~0.base_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t167~0.base_9| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t167~0.offset_8| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t167~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t167~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t167~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t167~0.base_9|) |v_ULTIMATE.start_main_~#t167~0.offset_8| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t167~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t167~0.offset=|v_ULTIMATE.start_main_~#t167~0.offset_8|, ULTIMATE.start_main_~#t167~0.base=|v_ULTIMATE.start_main_~#t167~0.base_9|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t167~0.offset, ULTIMATE.start_main_~#t167~0.base] because there is no mapped edge [2019-12-07 19:22:10,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In638095628 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In638095628| |P2Thread1of1ForFork0_#t~ite20_Out638095628|) (not .cse0) (= ~z$w_buff0~0_In638095628 |P2Thread1of1ForFork0_#t~ite21_Out638095628|)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out638095628| |P2Thread1of1ForFork0_#t~ite20_Out638095628|) (= ~z$w_buff0~0_In638095628 |P2Thread1of1ForFork0_#t~ite20_Out638095628|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In638095628 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In638095628 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In638095628 256))) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In638095628 256) 0))))))) InVars {~z$w_buff0~0=~z$w_buff0~0_In638095628, ~z$w_buff0_used~0=~z$w_buff0_used~0_In638095628, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In638095628, ~z$w_buff1_used~0=~z$w_buff1_used~0_In638095628, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In638095628, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In638095628|, ~weak$$choice2~0=~weak$$choice2~0_In638095628} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out638095628|, ~z$w_buff0~0=~z$w_buff0~0_In638095628, ~z$w_buff0_used~0=~z$w_buff0_used~0_In638095628, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In638095628, ~z$w_buff1_used~0=~z$w_buff1_used~0_In638095628, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In638095628, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out638095628|, ~weak$$choice2~0=~weak$$choice2~0_In638095628} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-07 19:22:10,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1662870181 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1662870181 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1662870181|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In-1662870181 |P1Thread1of1ForFork2_#t~ite13_Out-1662870181|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1662870181, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1662870181} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1662870181, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1662870181|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1662870181} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 19:22:10,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1458574194 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1458574194 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1458574194 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1458574194 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1458574194| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite14_Out-1458574194| ~z$r_buff1_thd2~0_In-1458574194)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1458574194, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1458574194, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1458574194, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1458574194} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1458574194, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1458574194, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1458574194, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1458574194|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1458574194} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 19:22:10,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= |v_P1Thread1of1ForFork2_#t~ite14_30| v_~z$r_buff1_thd2~0_56) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_30|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_29|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 19:22:10,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In848822332 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out848822332| |P2Thread1of1ForFork0_#t~ite23_Out848822332|) (= ~z$w_buff1~0_In848822332 |P2Thread1of1ForFork0_#t~ite23_Out848822332|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In848822332 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In848822332 256) 0)) (and (= (mod ~z$w_buff1_used~0_In848822332 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In848822332 256))))) (and (= ~z$w_buff1~0_In848822332 |P2Thread1of1ForFork0_#t~ite24_Out848822332|) (= |P2Thread1of1ForFork0_#t~ite23_In848822332| |P2Thread1of1ForFork0_#t~ite23_Out848822332|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In848822332, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In848822332, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In848822332|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In848822332, ~z$w_buff1~0=~z$w_buff1~0_In848822332, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In848822332, ~weak$$choice2~0=~weak$$choice2~0_In848822332} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In848822332, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out848822332|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In848822332, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out848822332|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In848822332, ~z$w_buff1~0=~z$w_buff1~0_In848822332, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In848822332, ~weak$$choice2~0=~weak$$choice2~0_In848822332} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-07 19:22:10,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L798-->L798-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-316375654 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out-316375654| ~z$w_buff0_used~0_In-316375654) (= |P2Thread1of1ForFork0_#t~ite26_In-316375654| |P2Thread1of1ForFork0_#t~ite26_Out-316375654|)) (and (= ~z$w_buff0_used~0_In-316375654 |P2Thread1of1ForFork0_#t~ite26_Out-316375654|) .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out-316375654| |P2Thread1of1ForFork0_#t~ite26_Out-316375654|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-316375654 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-316375654 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-316375654 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-316375654 256) 0))))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-316375654|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-316375654, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-316375654, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-316375654, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-316375654, ~weak$$choice2~0=~weak$$choice2~0_In-316375654} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-316375654|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-316375654|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-316375654, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-316375654, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-316375654, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-316375654, ~weak$$choice2~0=~weak$$choice2~0_In-316375654} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-07 19:22:10,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff0_thd3~0_66)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:22:10,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= v_~z~0_50 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 19:22:10,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1494856955 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1494856955 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1494856955| 0) (not .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1494856955| ~z$w_buff0_used~0_In-1494856955) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1494856955, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1494856955} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1494856955|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1494856955, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1494856955} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 19:22:10,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-402265928 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-402265928 256)))) (or (and (= ~z~0_In-402265928 |P2Thread1of1ForFork0_#t~ite38_Out-402265928|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In-402265928 |P2Thread1of1ForFork0_#t~ite38_Out-402265928|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-402265928, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-402265928, ~z$w_buff1~0=~z$w_buff1~0_In-402265928, ~z~0=~z~0_In-402265928} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-402265928|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-402265928, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-402265928, ~z$w_buff1~0=~z$w_buff1~0_In-402265928, ~z~0=~z~0_In-402265928} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 19:22:10,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1729998717 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1729998717 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1729998717 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In1729998717 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1729998717 |P0Thread1of1ForFork1_#t~ite6_Out1729998717|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1729998717|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1729998717, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1729998717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1729998717, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1729998717} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1729998717, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1729998717|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1729998717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1729998717, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1729998717} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 19:22:10,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse1 (= ~z$r_buff0_thd1~0_In-1068621965 ~z$r_buff0_thd1~0_Out-1068621965)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1068621965 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1068621965 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (= 0 ~z$r_buff0_thd1~0_Out-1068621965) (not .cse0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1068621965, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1068621965} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1068621965, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1068621965|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1068621965} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:22:10,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In2116707585 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In2116707585 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In2116707585 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2116707585 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out2116707585| ~z$r_buff1_thd1~0_In2116707585) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite8_Out2116707585| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2116707585, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2116707585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2116707585, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2116707585} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out2116707585|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2116707585, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2116707585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2116707585, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2116707585} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 19:22:10,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~z$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_29|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 19:22:10,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_5|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-07 19:22:10,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1713047091 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1713047091 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1713047091| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out1713047091| ~z$w_buff0_used~0_In1713047091)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1713047091, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1713047091} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1713047091, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1713047091|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1713047091} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 19:22:10,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1814525626 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1814525626 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1814525626 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1814525626 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-1814525626| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-1814525626| ~z$w_buff1_used~0_In-1814525626)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1814525626, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1814525626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1814525626, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1814525626} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1814525626, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1814525626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1814525626, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1814525626, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1814525626|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 19:22:10,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-558944640 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-558944640 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-558944640| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-558944640| ~z$r_buff0_thd3~0_In-558944640) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-558944640, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-558944640} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-558944640, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-558944640, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-558944640|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 19:22:10,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In-225287584 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-225287584 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-225287584 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-225287584 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-225287584 |P2Thread1of1ForFork0_#t~ite43_Out-225287584|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite43_Out-225287584| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-225287584, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-225287584, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-225287584, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-225287584} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-225287584|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-225287584, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-225287584, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-225287584, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-225287584} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 19:22:10,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= v_~z$r_buff1_thd3~0_121 |v_P2Thread1of1ForFork0_#t~ite43_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_121, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 19:22:10,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_11 256))) (= v_~main$tmp_guard0~0_11 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_28) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:22:10,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1973018230 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1973018230 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out1973018230| |ULTIMATE.start_main_#t~ite48_Out1973018230|))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite47_Out1973018230| ~z~0_In1973018230)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out1973018230| ~z$w_buff1~0_In1973018230) (not .cse0) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1973018230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1973018230, ~z$w_buff1~0=~z$w_buff1~0_In1973018230, ~z~0=~z~0_In1973018230} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1973018230, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1973018230|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1973018230, ~z$w_buff1~0=~z$w_buff1~0_In1973018230, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1973018230|, ~z~0=~z~0_In1973018230} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 19:22:10,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2024720771 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2024720771 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out2024720771|)) (and (= ~z$w_buff0_used~0_In2024720771 |ULTIMATE.start_main_#t~ite49_Out2024720771|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2024720771, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2024720771} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2024720771, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2024720771, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out2024720771|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 19:22:10,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In471443917 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In471443917 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In471443917 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In471443917 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out471443917| ~z$w_buff1_used~0_In471443917)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite50_Out471443917| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In471443917, ~z$w_buff0_used~0=~z$w_buff0_used~0_In471443917, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In471443917, ~z$w_buff1_used~0=~z$w_buff1_used~0_In471443917} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out471443917|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In471443917, ~z$w_buff0_used~0=~z$w_buff0_used~0_In471443917, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In471443917, ~z$w_buff1_used~0=~z$w_buff1_used~0_In471443917} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 19:22:10,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-369749280 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-369749280 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-369749280|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-369749280 |ULTIMATE.start_main_#t~ite51_Out-369749280|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-369749280, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-369749280} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-369749280, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-369749280|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-369749280} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 19:22:10,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1176956819 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1176956819 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1176956819 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1176956819 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1176956819| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite52_Out-1176956819| ~z$r_buff1_thd0~0_In-1176956819) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1176956819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1176956819, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1176956819, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1176956819} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1176956819|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1176956819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1176956819, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1176956819, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1176956819} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 19:22:10,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_22) (= v_~x~0_65 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= v_~__unbuffered_p1_EBX~0_23 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_101, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:22:10,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:22:10 BasicIcfg [2019-12-07 19:22:10,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:22:10,571 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:22:10,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:22:10,571 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:22:10,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:19:17" (3/4) ... [2019-12-07 19:22:10,573 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:22:10,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~z$r_buff0_thd3~0_367) (= v_~z$r_buff0_thd0~0_147 0) (= v_~z$w_buff0_used~0_850 0) (= v_~z$w_buff0~0_393 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_322) (= v_~weak$$choice2~0_147 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t165~0.base_27|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd1~0_158 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t165~0.base_27| 4)) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_168 0) (= v_~z$w_buff1_used~0_568 0) (= v_~main$tmp_guard1~0_41 0) (= |v_ULTIMATE.start_main_~#t165~0.offset_17| 0) (= 0 v_~__unbuffered_p2_EAX~0_41) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_26) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= v_~z$r_buff0_thd1~0_210 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t165~0.base_27| 1)) (= 0 v_~x~0_154) (= v_~z$r_buff0_thd2~0_129 0) (= 0 v_~__unbuffered_cnt~0_88) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t165~0.base_27| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t165~0.base_27|) |v_ULTIMATE.start_main_~#t165~0.offset_17| 0)) |v_#memory_int_19|) (= v_~z~0_181 0) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t165~0.base_27|)) (= v_~y~0_31 0) (= v_~z$r_buff1_thd0~0_191 0) (= v_~z$w_buff1~0_253 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_168, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_61|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_191|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ULTIMATE.start_main_~#t167~0.offset=|v_ULTIMATE.start_main_~#t167~0.offset_17|, ULTIMATE.start_main_~#t166~0.offset=|v_ULTIMATE.start_main_~#t166~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_568, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ULTIMATE.start_main_~#t165~0.base=|v_ULTIMATE.start_main_~#t165~0.base_27|, ~weak$$choice0~0=v_~weak$$choice0~0_13, ULTIMATE.start_main_~#t165~0.offset=|v_ULTIMATE.start_main_~#t165~0.offset_17|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t166~0.base=|v_ULTIMATE.start_main_~#t166~0.base_22|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_158, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_367, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~x~0=v_~x~0_154, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_253, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_39|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_191, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_129, ULTIMATE.start_main_~#t167~0.base=|v_ULTIMATE.start_main_~#t167~0.base_23|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_850, ~z$w_buff0~0=v_~z$w_buff0~0_393, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_322, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_210} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t167~0.offset, ULTIMATE.start_main_~#t166~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t165~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t165~0.offset, ULTIMATE.start_main_~#t166~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t167~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:22:10,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L830-1-->L832: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t166~0.base_11| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t166~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t166~0.base_11|) |v_ULTIMATE.start_main_~#t166~0.offset_9| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t166~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t166~0.base_11|) (= |v_ULTIMATE.start_main_~#t166~0.offset_9| 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t166~0.base_11| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t166~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t166~0.offset=|v_ULTIMATE.start_main_~#t166~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t166~0.base=|v_ULTIMATE.start_main_~#t166~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t166~0.offset, ULTIMATE.start_main_~#t166~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 19:22:10,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= v_~z$r_buff0_thd0~0_17 v_~z$r_buff1_thd0~0_13) (= 1 v_~x~0_6) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_4)) (= v_~z$r_buff0_thd1~0_21 1) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_31) (= v_~z$r_buff0_thd1~0_22 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_4, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_31, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_13, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_4, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_21, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 19:22:10,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In2013993993 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In2013993993 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out2013993993| ~z~0_In2013993993) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out2013993993| ~z$w_buff1~0_In2013993993) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2013993993, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2013993993, ~z$w_buff1~0=~z$w_buff1~0_In2013993993, ~z~0=~z~0_In2013993993} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out2013993993|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2013993993, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2013993993, ~z$w_buff1~0=~z$w_buff1~0_In2013993993, ~z~0=~z~0_In2013993993} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 19:22:10,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_10| v_~z~0_27) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_10|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_9|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_15|, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-07 19:22:10,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-1107750427 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1107750427 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1107750427| ~z$w_buff0_used~0_In-1107750427)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1107750427| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1107750427, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1107750427} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1107750427, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1107750427|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1107750427} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 19:22:10,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-81912080 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-81912080 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-81912080 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-81912080 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-81912080|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out-81912080| ~z$w_buff1_used~0_In-81912080) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-81912080, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-81912080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-81912080, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-81912080} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-81912080, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-81912080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-81912080, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-81912080|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-81912080} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 19:22:10,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t167~0.base_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t167~0.base_9| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t167~0.offset_8| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t167~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t167~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t167~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t167~0.base_9|) |v_ULTIMATE.start_main_~#t167~0.offset_8| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t167~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t167~0.offset=|v_ULTIMATE.start_main_~#t167~0.offset_8|, ULTIMATE.start_main_~#t167~0.base=|v_ULTIMATE.start_main_~#t167~0.base_9|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t167~0.offset, ULTIMATE.start_main_~#t167~0.base] because there is no mapped edge [2019-12-07 19:22:10,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In638095628 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In638095628| |P2Thread1of1ForFork0_#t~ite20_Out638095628|) (not .cse0) (= ~z$w_buff0~0_In638095628 |P2Thread1of1ForFork0_#t~ite21_Out638095628|)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out638095628| |P2Thread1of1ForFork0_#t~ite20_Out638095628|) (= ~z$w_buff0~0_In638095628 |P2Thread1of1ForFork0_#t~ite20_Out638095628|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In638095628 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In638095628 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In638095628 256))) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In638095628 256) 0))))))) InVars {~z$w_buff0~0=~z$w_buff0~0_In638095628, ~z$w_buff0_used~0=~z$w_buff0_used~0_In638095628, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In638095628, ~z$w_buff1_used~0=~z$w_buff1_used~0_In638095628, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In638095628, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In638095628|, ~weak$$choice2~0=~weak$$choice2~0_In638095628} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out638095628|, ~z$w_buff0~0=~z$w_buff0~0_In638095628, ~z$w_buff0_used~0=~z$w_buff0_used~0_In638095628, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In638095628, ~z$w_buff1_used~0=~z$w_buff1_used~0_In638095628, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In638095628, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out638095628|, ~weak$$choice2~0=~weak$$choice2~0_In638095628} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-07 19:22:10,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1662870181 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1662870181 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1662870181|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In-1662870181 |P1Thread1of1ForFork2_#t~ite13_Out-1662870181|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1662870181, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1662870181} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1662870181, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1662870181|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1662870181} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 19:22:10,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1458574194 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1458574194 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1458574194 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1458574194 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1458574194| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite14_Out-1458574194| ~z$r_buff1_thd2~0_In-1458574194)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1458574194, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1458574194, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1458574194, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1458574194} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1458574194, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1458574194, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1458574194, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1458574194|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1458574194} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 19:22:10,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= |v_P1Thread1of1ForFork2_#t~ite14_30| v_~z$r_buff1_thd2~0_56) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_30|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_29|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 19:22:10,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In848822332 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out848822332| |P2Thread1of1ForFork0_#t~ite23_Out848822332|) (= ~z$w_buff1~0_In848822332 |P2Thread1of1ForFork0_#t~ite23_Out848822332|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In848822332 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In848822332 256) 0)) (and (= (mod ~z$w_buff1_used~0_In848822332 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In848822332 256))))) (and (= ~z$w_buff1~0_In848822332 |P2Thread1of1ForFork0_#t~ite24_Out848822332|) (= |P2Thread1of1ForFork0_#t~ite23_In848822332| |P2Thread1of1ForFork0_#t~ite23_Out848822332|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In848822332, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In848822332, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In848822332|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In848822332, ~z$w_buff1~0=~z$w_buff1~0_In848822332, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In848822332, ~weak$$choice2~0=~weak$$choice2~0_In848822332} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In848822332, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out848822332|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In848822332, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out848822332|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In848822332, ~z$w_buff1~0=~z$w_buff1~0_In848822332, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In848822332, ~weak$$choice2~0=~weak$$choice2~0_In848822332} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-07 19:22:10,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L798-->L798-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-316375654 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out-316375654| ~z$w_buff0_used~0_In-316375654) (= |P2Thread1of1ForFork0_#t~ite26_In-316375654| |P2Thread1of1ForFork0_#t~ite26_Out-316375654|)) (and (= ~z$w_buff0_used~0_In-316375654 |P2Thread1of1ForFork0_#t~ite26_Out-316375654|) .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out-316375654| |P2Thread1of1ForFork0_#t~ite26_Out-316375654|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-316375654 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-316375654 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-316375654 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-316375654 256) 0))))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-316375654|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-316375654, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-316375654, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-316375654, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-316375654, ~weak$$choice2~0=~weak$$choice2~0_In-316375654} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-316375654|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-316375654|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-316375654, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-316375654, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-316375654, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-316375654, ~weak$$choice2~0=~weak$$choice2~0_In-316375654} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-07 19:22:10,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff0_thd3~0_66)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:22:10,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= v_~z~0_50 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 19:22:10,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1494856955 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1494856955 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1494856955| 0) (not .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1494856955| ~z$w_buff0_used~0_In-1494856955) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1494856955, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1494856955} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1494856955|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1494856955, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1494856955} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 19:22:10,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-402265928 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-402265928 256)))) (or (and (= ~z~0_In-402265928 |P2Thread1of1ForFork0_#t~ite38_Out-402265928|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In-402265928 |P2Thread1of1ForFork0_#t~ite38_Out-402265928|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-402265928, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-402265928, ~z$w_buff1~0=~z$w_buff1~0_In-402265928, ~z~0=~z~0_In-402265928} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-402265928|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-402265928, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-402265928, ~z$w_buff1~0=~z$w_buff1~0_In-402265928, ~z~0=~z~0_In-402265928} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 19:22:10,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1729998717 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1729998717 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1729998717 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In1729998717 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1729998717 |P0Thread1of1ForFork1_#t~ite6_Out1729998717|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1729998717|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1729998717, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1729998717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1729998717, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1729998717} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1729998717, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1729998717|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1729998717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1729998717, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1729998717} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 19:22:10,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse1 (= ~z$r_buff0_thd1~0_In-1068621965 ~z$r_buff0_thd1~0_Out-1068621965)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1068621965 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1068621965 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (= 0 ~z$r_buff0_thd1~0_Out-1068621965) (not .cse0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1068621965, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1068621965} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1068621965, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1068621965|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1068621965} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:22:10,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In2116707585 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In2116707585 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In2116707585 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2116707585 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out2116707585| ~z$r_buff1_thd1~0_In2116707585) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite8_Out2116707585| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2116707585, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2116707585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2116707585, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2116707585} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out2116707585|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2116707585, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2116707585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2116707585, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2116707585} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 19:22:10,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~z$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_29|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 19:22:10,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_5|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-07 19:22:10,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1713047091 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1713047091 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1713047091| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out1713047091| ~z$w_buff0_used~0_In1713047091)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1713047091, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1713047091} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1713047091, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1713047091|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1713047091} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 19:22:10,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1814525626 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1814525626 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1814525626 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1814525626 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-1814525626| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-1814525626| ~z$w_buff1_used~0_In-1814525626)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1814525626, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1814525626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1814525626, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1814525626} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1814525626, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1814525626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1814525626, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1814525626, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1814525626|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 19:22:10,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-558944640 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-558944640 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-558944640| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-558944640| ~z$r_buff0_thd3~0_In-558944640) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-558944640, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-558944640} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-558944640, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-558944640, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-558944640|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 19:22:10,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In-225287584 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-225287584 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-225287584 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-225287584 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-225287584 |P2Thread1of1ForFork0_#t~ite43_Out-225287584|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite43_Out-225287584| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-225287584, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-225287584, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-225287584, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-225287584} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-225287584|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-225287584, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-225287584, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-225287584, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-225287584} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 19:22:10,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= v_~z$r_buff1_thd3~0_121 |v_P2Thread1of1ForFork0_#t~ite43_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_121, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 19:22:10,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_11 256))) (= v_~main$tmp_guard0~0_11 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_28) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:22:10,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1973018230 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1973018230 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out1973018230| |ULTIMATE.start_main_#t~ite48_Out1973018230|))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite47_Out1973018230| ~z~0_In1973018230)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out1973018230| ~z$w_buff1~0_In1973018230) (not .cse0) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1973018230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1973018230, ~z$w_buff1~0=~z$w_buff1~0_In1973018230, ~z~0=~z~0_In1973018230} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1973018230, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1973018230|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1973018230, ~z$w_buff1~0=~z$w_buff1~0_In1973018230, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1973018230|, ~z~0=~z~0_In1973018230} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 19:22:10,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2024720771 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2024720771 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out2024720771|)) (and (= ~z$w_buff0_used~0_In2024720771 |ULTIMATE.start_main_#t~ite49_Out2024720771|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2024720771, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2024720771} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2024720771, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2024720771, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out2024720771|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 19:22:10,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In471443917 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In471443917 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In471443917 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In471443917 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out471443917| ~z$w_buff1_used~0_In471443917)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite50_Out471443917| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In471443917, ~z$w_buff0_used~0=~z$w_buff0_used~0_In471443917, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In471443917, ~z$w_buff1_used~0=~z$w_buff1_used~0_In471443917} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out471443917|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In471443917, ~z$w_buff0_used~0=~z$w_buff0_used~0_In471443917, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In471443917, ~z$w_buff1_used~0=~z$w_buff1_used~0_In471443917} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 19:22:10,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-369749280 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-369749280 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-369749280|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-369749280 |ULTIMATE.start_main_#t~ite51_Out-369749280|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-369749280, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-369749280} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-369749280, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-369749280|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-369749280} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 19:22:10,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1176956819 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1176956819 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1176956819 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1176956819 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1176956819| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite52_Out-1176956819| ~z$r_buff1_thd0~0_In-1176956819) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1176956819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1176956819, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1176956819, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1176956819} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1176956819|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1176956819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1176956819, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1176956819, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1176956819} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 19:22:10,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_22) (= v_~x~0_65 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= v_~__unbuffered_p1_EBX~0_23 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_101, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:22:10,634 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d6ef9aa4-6d7f-45d7-afac-8a14cf36a98d/bin/utaipan/witness.graphml [2019-12-07 19:22:10,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:22:10,635 INFO L168 Benchmark]: Toolchain (without parser) took 174473.74 ms. Allocated memory was 1.0 GB in the beginning and 8.9 GB in the end (delta: 7.9 GB). Free memory was 940.9 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 5.8 GB. Max. memory is 11.5 GB. [2019-12-07 19:22:10,635 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:22:10,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:22:10,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:22:10,636 INFO L168 Benchmark]: Boogie Preprocessor took 24.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:22:10,636 INFO L168 Benchmark]: RCFGBuilder took 413.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2019-12-07 19:22:10,636 INFO L168 Benchmark]: TraceAbstraction took 173549.04 ms. Allocated memory was 1.1 GB in the beginning and 8.9 GB in the end (delta: 7.8 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 5.7 GB. Max. memory is 11.5 GB. [2019-12-07 19:22:10,637 INFO L168 Benchmark]: Witness Printer took 63.07 ms. Allocated memory is still 8.9 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:22:10,638 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 413.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 173549.04 ms. Allocated memory was 1.1 GB in the beginning and 8.9 GB in the end (delta: 7.8 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 5.7 GB. Max. memory is 11.5 GB. * Witness Printer took 63.07 ms. Allocated memory is still 8.9 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7398 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 70 SemBasedMoverChecksPositive, 270 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 78628 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = x [L768] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L834] FCALL, FORK 0 pthread_create(&t167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 y = 1 [L788] 3 __unbuffered_p2_EAX = y [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 z$flush_delayed = weak$$choice2 [L794] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L796] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L773] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L774] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L798] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L807] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L810] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 173.4s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 47.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6551 SDtfs, 11951 SDslu, 17897 SDs, 0 SdLazy, 15270 SolverSat, 1009 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 70 SyntacticMatches, 18 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10347 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301435occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 106.0s AutomataMinimizationTime, 29 MinimizatonAttempts, 837564 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1107 NumberOfCodeBlocks, 1107 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1011 ConstructedInterpolants, 0 QuantifiedInterpolants, 226832 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...