./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe010_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_5f137b95-8a06-4550-b395-ec5615bb472a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5f137b95-8a06-4550-b395-ec5615bb472a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5f137b95-8a06-4550-b395-ec5615bb472a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5f137b95-8a06-4550-b395-ec5615bb472a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe010_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5f137b95-8a06-4550-b395-ec5615bb472a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5f137b95-8a06-4550-b395-ec5615bb472a/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 ad7a03e4ce6743566424918d18fa966b8d8855df ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:10:42,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:10:42,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:10:42,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:10:42,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:10:42,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:10:42,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:10:42,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:10:42,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:10:42,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:10:42,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:10:42,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:10:42,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:10:42,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:10:42,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:10:42,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:10:42,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:10:42,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:10:42,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:10:42,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:10:42,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:10:42,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:10:42,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:10:42,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:10:42,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:10:42,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:10:42,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:10:42,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:10:42,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:10:42,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:10:42,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:10:42,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:10:42,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:10:42,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:10:42,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:10:42,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:10:42,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:10:42,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:10:42,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:10:42,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:10:42,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:10:42,508 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5f137b95-8a06-4550-b395-ec5615bb472a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:10:42,521 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:10:42,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:10:42,521 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:10:42,522 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:10:42,522 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:10:42,522 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:10:42,522 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:10:42,522 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:10:42,523 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:10:42,523 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:10:42,523 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:10:42,523 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:10:42,523 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:10:42,524 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:10:42,524 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:10:42,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:10:42,525 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:10:42,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:10:42,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:10:42,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:10:42,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:10:42,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:10:42,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:10:42,526 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:10:42,526 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:10:42,526 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:10:42,526 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:10:42,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:10:42,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:10:42,527 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:10:42,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:10:42,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:10:42,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:10:42,527 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:10:42,527 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:10:42,528 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:10:42,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:10:42,528 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:10:42,528 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:10:42,528 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:10:42,528 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_5f137b95-8a06-4550-b395-ec5615bb472a/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 -> ad7a03e4ce6743566424918d18fa966b8d8855df [2019-12-07 19:10:42,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:10:42,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:10:42,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:10:42,638 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:10:42,638 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:10:42,638 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5f137b95-8a06-4550-b395-ec5615bb472a/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe010_rmo.oepc.i [2019-12-07 19:10:42,675 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5f137b95-8a06-4550-b395-ec5615bb472a/bin/utaipan/data/a46ea4e54/8203079c7e524994b0ea9b274083e53e/FLAG8a408f3d5 [2019-12-07 19:10:43,142 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:10:43,142 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5f137b95-8a06-4550-b395-ec5615bb472a/sv-benchmarks/c/pthread-wmm/safe010_rmo.oepc.i [2019-12-07 19:10:43,154 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5f137b95-8a06-4550-b395-ec5615bb472a/bin/utaipan/data/a46ea4e54/8203079c7e524994b0ea9b274083e53e/FLAG8a408f3d5 [2019-12-07 19:10:43,163 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5f137b95-8a06-4550-b395-ec5615bb472a/bin/utaipan/data/a46ea4e54/8203079c7e524994b0ea9b274083e53e [2019-12-07 19:10:43,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:10:43,166 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:10:43,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:10:43,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:10:43,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:10:43,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:10:43" (1/1) ... [2019-12-07 19:10:43,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb575a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:10:43, skipping insertion in model container [2019-12-07 19:10:43,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:10:43" (1/1) ... [2019-12-07 19:10:43,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:10:43,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:10:43,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:10:43,451 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:10:43,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:10:43,534 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:10:43,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:10:43 WrapperNode [2019-12-07 19:10:43,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:10:43,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:10:43,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:10:43,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:10:43,540 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:10:43" (1/1) ... [2019-12-07 19:10:43,552 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:10:43" (1/1) ... [2019-12-07 19:10:43,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:10:43,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:10:43,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:10:43,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:10:43,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:10:43" (1/1) ... [2019-12-07 19:10:43,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:10:43" (1/1) ... [2019-12-07 19:10:43,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:10:43" (1/1) ... [2019-12-07 19:10:43,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:10:43" (1/1) ... [2019-12-07 19:10:43,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:10:43" (1/1) ... [2019-12-07 19:10:43,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:10:43" (1/1) ... [2019-12-07 19:10:43,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:10:43" (1/1) ... [2019-12-07 19:10:43,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:10:43,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:10:43,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:10:43,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:10:43,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:10:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f137b95-8a06-4550-b395-ec5615bb472a/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:10:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:10:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:10:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:10:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:10:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:10:43,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:10:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:10:43,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:10:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:10:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:10:43,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:10:43,638 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:10:43,971 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:10:43,971 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:10:43,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:10:43 BoogieIcfgContainer [2019-12-07 19:10:43,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:10:43,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:10:43,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:10:43,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:10:43,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:10:43" (1/3) ... [2019-12-07 19:10:43,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134a2884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:10:43, skipping insertion in model container [2019-12-07 19:10:43,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:10:43" (2/3) ... [2019-12-07 19:10:43,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134a2884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:10:43, skipping insertion in model container [2019-12-07 19:10:43,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:10:43" (3/3) ... [2019-12-07 19:10:43,977 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_rmo.oepc.i [2019-12-07 19:10:43,983 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:10:43,983 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:10:43,987 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:10:43,988 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:10:44,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,008 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,008 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,008 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,009 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,009 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,013 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:10:44,028 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 19:10:44,040 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:10:44,040 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:10:44,041 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:10:44,041 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:10:44,041 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:10:44,041 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:10:44,041 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:10:44,041 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:10:44,051 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-07 19:10:44,052 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-07 19:10:44,099 INFO L134 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-07 19:10:44,099 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:10:44,107 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 460 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 19:10:44,118 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-07 19:10:44,139 INFO L134 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-07 19:10:44,139 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:10:44,142 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 460 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 19:10:44,150 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-07 19:10:44,151 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:10:46,879 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-07 19:10:46,953 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46090 [2019-12-07 19:10:46,954 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-07 19:10:46,956 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 91 transitions [2019-12-07 19:10:47,305 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8654 states. [2019-12-07 19:10:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 8654 states. [2019-12-07 19:10:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 19:10:47,310 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:47,311 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 19:10:47,311 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:47,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:47,315 INFO L82 PathProgramCache]: Analyzing trace with hash 722891, now seen corresponding path program 1 times [2019-12-07 19:10:47,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:47,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214874235] [2019-12-07 19:10:47,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:47,451 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:10:47,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214874235] [2019-12-07 19:10:47,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:47,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:10:47,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798902610] [2019-12-07 19:10:47,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:10:47,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:47,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:10:47,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:10:47,472 INFO L87 Difference]: Start difference. First operand 8654 states. Second operand 3 states. [2019-12-07 19:10:47,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:47,632 INFO L93 Difference]: Finished difference Result 8604 states and 28108 transitions. [2019-12-07 19:10:47,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:10:47,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 19:10:47,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:47,693 INFO L225 Difference]: With dead ends: 8604 [2019-12-07 19:10:47,693 INFO L226 Difference]: Without dead ends: 8436 [2019-12-07 19:10:47,694 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:10:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8436 states. [2019-12-07 19:10:47,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8436 to 8436. [2019-12-07 19:10:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8436 states. [2019-12-07 19:10:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 27590 transitions. [2019-12-07 19:10:47,979 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 27590 transitions. Word has length 3 [2019-12-07 19:10:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:47,980 INFO L462 AbstractCegarLoop]: Abstraction has 8436 states and 27590 transitions. [2019-12-07 19:10:47,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:10:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 27590 transitions. [2019-12-07 19:10:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:10:47,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:47,982 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:10:47,982 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1596153002, now seen corresponding path program 1 times [2019-12-07 19:10:47,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:47,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221960663] [2019-12-07 19:10:47,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:48,045 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:10:48,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221960663] [2019-12-07 19:10:48,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:48,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:10:48,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184711873] [2019-12-07 19:10:48,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:10:48,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:48,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:10:48,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:10:48,048 INFO L87 Difference]: Start difference. First operand 8436 states and 27590 transitions. Second operand 4 states. [2019-12-07 19:10:48,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:48,288 INFO L93 Difference]: Finished difference Result 13130 states and 41153 transitions. [2019-12-07 19:10:48,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:10:48,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 19:10:48,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:48,341 INFO L225 Difference]: With dead ends: 13130 [2019-12-07 19:10:48,341 INFO L226 Difference]: Without dead ends: 13123 [2019-12-07 19:10:48,342 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:10:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2019-12-07 19:10:48,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 11988. [2019-12-07 19:10:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11988 states. [2019-12-07 19:10:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11988 states to 11988 states and 38075 transitions. [2019-12-07 19:10:48,633 INFO L78 Accepts]: Start accepts. Automaton has 11988 states and 38075 transitions. Word has length 11 [2019-12-07 19:10:48,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:48,634 INFO L462 AbstractCegarLoop]: Abstraction has 11988 states and 38075 transitions. [2019-12-07 19:10:48,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:10:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 11988 states and 38075 transitions. [2019-12-07 19:10:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:10:48,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:48,636 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:10:48,636 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:48,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:48,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1194917716, now seen corresponding path program 1 times [2019-12-07 19:10:48,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:48,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784793143] [2019-12-07 19:10:48,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:48,684 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:10:48,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784793143] [2019-12-07 19:10:48,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:48,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:10:48,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405432134] [2019-12-07 19:10:48,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:10:48,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:48,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:10:48,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:10:48,686 INFO L87 Difference]: Start difference. First operand 11988 states and 38075 transitions. Second operand 4 states. [2019-12-07 19:10:48,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:48,838 INFO L93 Difference]: Finished difference Result 14736 states and 46267 transitions. [2019-12-07 19:10:48,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:10:48,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 19:10:48,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:48,866 INFO L225 Difference]: With dead ends: 14736 [2019-12-07 19:10:48,866 INFO L226 Difference]: Without dead ends: 14736 [2019-12-07 19:10:48,866 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:10:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14736 states. [2019-12-07 19:10:49,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14736 to 13160. [2019-12-07 19:10:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13160 states. [2019-12-07 19:10:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 41689 transitions. [2019-12-07 19:10:49,107 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 41689 transitions. Word has length 11 [2019-12-07 19:10:49,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:49,108 INFO L462 AbstractCegarLoop]: Abstraction has 13160 states and 41689 transitions. [2019-12-07 19:10:49,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:10:49,108 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 41689 transitions. [2019-12-07 19:10:49,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:10:49,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:49,111 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:10:49,111 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:49,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:49,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1502155024, now seen corresponding path program 1 times [2019-12-07 19:10:49,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:49,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461182882] [2019-12-07 19:10:49,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:49,159 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:10:49,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461182882] [2019-12-07 19:10:49,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:49,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:10:49,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934006154] [2019-12-07 19:10:49,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:10:49,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:49,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:10:49,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:10:49,161 INFO L87 Difference]: Start difference. First operand 13160 states and 41689 transitions. Second operand 5 states. [2019-12-07 19:10:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:49,453 INFO L93 Difference]: Finished difference Result 17572 states and 54523 transitions. [2019-12-07 19:10:49,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:10:49,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 19:10:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:49,476 INFO L225 Difference]: With dead ends: 17572 [2019-12-07 19:10:49,476 INFO L226 Difference]: Without dead ends: 17565 [2019-12-07 19:10:49,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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:10:49,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17565 states. [2019-12-07 19:10:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17565 to 13105. [2019-12-07 19:10:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13105 states. [2019-12-07 19:10:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13105 states to 13105 states and 41426 transitions. [2019-12-07 19:10:49,699 INFO L78 Accepts]: Start accepts. Automaton has 13105 states and 41426 transitions. Word has length 17 [2019-12-07 19:10:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:49,699 INFO L462 AbstractCegarLoop]: Abstraction has 13105 states and 41426 transitions. [2019-12-07 19:10:49,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:10:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 13105 states and 41426 transitions. [2019-12-07 19:10:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:10:49,707 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:49,707 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] [2019-12-07 19:10:49,707 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:49,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:49,707 INFO L82 PathProgramCache]: Analyzing trace with hash 933350131, now seen corresponding path program 1 times [2019-12-07 19:10:49,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:49,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352603250] [2019-12-07 19:10:49,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:49,738 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:10:49,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352603250] [2019-12-07 19:10:49,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:49,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:10:49,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65606065] [2019-12-07 19:10:49,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:10:49,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:49,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:10:49,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:10:49,739 INFO L87 Difference]: Start difference. First operand 13105 states and 41426 transitions. Second operand 3 states. [2019-12-07 19:10:49,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:49,809 INFO L93 Difference]: Finished difference Result 16057 states and 50095 transitions. [2019-12-07 19:10:49,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:10:49,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 19:10:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:49,836 INFO L225 Difference]: With dead ends: 16057 [2019-12-07 19:10:49,836 INFO L226 Difference]: Without dead ends: 16057 [2019-12-07 19:10:49,836 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:10:49,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16057 states. [2019-12-07 19:10:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16057 to 14186. [2019-12-07 19:10:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14186 states. [2019-12-07 19:10:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 44710 transitions. [2019-12-07 19:10:50,088 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 44710 transitions. Word has length 25 [2019-12-07 19:10:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:50,088 INFO L462 AbstractCegarLoop]: Abstraction has 14186 states and 44710 transitions. [2019-12-07 19:10:50,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:10:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 44710 transitions. [2019-12-07 19:10:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:10:50,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:50,095 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] [2019-12-07 19:10:50,095 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:50,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:50,095 INFO L82 PathProgramCache]: Analyzing trace with hash 933194542, now seen corresponding path program 1 times [2019-12-07 19:10:50,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:50,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128595296] [2019-12-07 19:10:50,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:50,141 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:10:50,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128595296] [2019-12-07 19:10:50,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:50,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:10:50,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19771133] [2019-12-07 19:10:50,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:10:50,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:50,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:10:50,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:10:50,143 INFO L87 Difference]: Start difference. First operand 14186 states and 44710 transitions. Second operand 4 states. [2019-12-07 19:10:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:50,163 INFO L93 Difference]: Finished difference Result 2296 states and 5226 transitions. [2019-12-07 19:10:50,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:10:50,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 19:10:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:50,166 INFO L225 Difference]: With dead ends: 2296 [2019-12-07 19:10:50,166 INFO L226 Difference]: Without dead ends: 2019 [2019-12-07 19:10:50,166 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:10:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-12-07 19:10:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2019. [2019-12-07 19:10:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-07 19:10:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4460 transitions. [2019-12-07 19:10:50,185 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4460 transitions. Word has length 25 [2019-12-07 19:10:50,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:50,185 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4460 transitions. [2019-12-07 19:10:50,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:10:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4460 transitions. [2019-12-07 19:10:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 19:10:50,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:50,187 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] [2019-12-07 19:10:50,187 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:50,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:50,188 INFO L82 PathProgramCache]: Analyzing trace with hash -568804126, now seen corresponding path program 1 times [2019-12-07 19:10:50,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:50,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891959316] [2019-12-07 19:10:50,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:50,264 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:10:50,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891959316] [2019-12-07 19:10:50,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:50,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:10:50,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020676657] [2019-12-07 19:10:50,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:10:50,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:50,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:10:50,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:10:50,265 INFO L87 Difference]: Start difference. First operand 2019 states and 4460 transitions. Second operand 5 states. [2019-12-07 19:10:50,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:50,295 INFO L93 Difference]: Finished difference Result 416 states and 758 transitions. [2019-12-07 19:10:50,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:10:50,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 19:10:50,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:50,295 INFO L225 Difference]: With dead ends: 416 [2019-12-07 19:10:50,295 INFO L226 Difference]: Without dead ends: 371 [2019-12-07 19:10:50,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:10:50,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-07 19:10:50,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 343. [2019-12-07 19:10:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-07 19:10:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 618 transitions. [2019-12-07 19:10:50,300 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 618 transitions. Word has length 37 [2019-12-07 19:10:50,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:50,300 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 618 transitions. [2019-12-07 19:10:50,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:10:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 618 transitions. [2019-12-07 19:10:50,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 19:10:50,302 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:50,302 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] [2019-12-07 19:10:50,302 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:50,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:50,303 INFO L82 PathProgramCache]: Analyzing trace with hash -506418728, now seen corresponding path program 1 times [2019-12-07 19:10:50,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:50,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364559764] [2019-12-07 19:10:50,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:50,392 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:10:50,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364559764] [2019-12-07 19:10:50,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:50,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:10:50,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006826694] [2019-12-07 19:10:50,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:10:50,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:50,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:10:50,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:10:50,394 INFO L87 Difference]: Start difference. First operand 343 states and 618 transitions. Second operand 7 states. [2019-12-07 19:10:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:50,631 INFO L93 Difference]: Finished difference Result 539 states and 970 transitions. [2019-12-07 19:10:50,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:10:50,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 19:10:50,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:50,632 INFO L225 Difference]: With dead ends: 539 [2019-12-07 19:10:50,632 INFO L226 Difference]: Without dead ends: 539 [2019-12-07 19:10:50,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:10:50,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-12-07 19:10:50,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 444. [2019-12-07 19:10:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-12-07 19:10:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 802 transitions. [2019-12-07 19:10:50,637 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 802 transitions. Word has length 52 [2019-12-07 19:10:50,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:50,638 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 802 transitions. [2019-12-07 19:10:50,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:10:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 802 transitions. [2019-12-07 19:10:50,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 19:10:50,639 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:50,639 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] [2019-12-07 19:10:50,639 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:50,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:50,639 INFO L82 PathProgramCache]: Analyzing trace with hash 22285210, now seen corresponding path program 2 times [2019-12-07 19:10:50,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:50,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198629174] [2019-12-07 19:10:50,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:50,693 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:10:50,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198629174] [2019-12-07 19:10:50,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:50,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:10:50,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502938773] [2019-12-07 19:10:50,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:10:50,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:50,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:10:50,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:10:50,695 INFO L87 Difference]: Start difference. First operand 444 states and 802 transitions. Second operand 5 states. [2019-12-07 19:10:50,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:50,816 INFO L93 Difference]: Finished difference Result 621 states and 1127 transitions. [2019-12-07 19:10:50,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:10:50,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-07 19:10:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:50,817 INFO L225 Difference]: With dead ends: 621 [2019-12-07 19:10:50,817 INFO L226 Difference]: Without dead ends: 621 [2019-12-07 19:10:50,817 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:10:50,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-12-07 19:10:50,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 504. [2019-12-07 19:10:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-12-07 19:10:50,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 921 transitions. [2019-12-07 19:10:50,822 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 921 transitions. Word has length 52 [2019-12-07 19:10:50,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:50,822 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 921 transitions. [2019-12-07 19:10:50,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:10:50,822 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 921 transitions. [2019-12-07 19:10:50,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 19:10:50,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:50,823 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] [2019-12-07 19:10:50,823 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:50,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:50,823 INFO L82 PathProgramCache]: Analyzing trace with hash 260455414, now seen corresponding path program 3 times [2019-12-07 19:10:50,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:50,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555717356] [2019-12-07 19:10:50,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:50,897 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:10:50,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555717356] [2019-12-07 19:10:50,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:50,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:10:50,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517047876] [2019-12-07 19:10:50,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:10:50,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:50,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:10:50,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:10:50,899 INFO L87 Difference]: Start difference. First operand 504 states and 921 transitions. Second operand 6 states. [2019-12-07 19:10:51,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:51,108 INFO L93 Difference]: Finished difference Result 719 states and 1302 transitions. [2019-12-07 19:10:51,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:10:51,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-07 19:10:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:51,109 INFO L225 Difference]: With dead ends: 719 [2019-12-07 19:10:51,109 INFO L226 Difference]: Without dead ends: 719 [2019-12-07 19:10:51,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:10:51,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-12-07 19:10:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 516. [2019-12-07 19:10:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-12-07 19:10:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 943 transitions. [2019-12-07 19:10:51,114 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 943 transitions. Word has length 52 [2019-12-07 19:10:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:51,114 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 943 transitions. [2019-12-07 19:10:51,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:10:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 943 transitions. [2019-12-07 19:10:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:10:51,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:51,115 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] [2019-12-07 19:10:51,115 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:51,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:51,116 INFO L82 PathProgramCache]: Analyzing trace with hash -681731879, now seen corresponding path program 1 times [2019-12-07 19:10:51,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:51,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208355189] [2019-12-07 19:10:51,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:51,287 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:10:51,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208355189] [2019-12-07 19:10:51,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:51,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 19:10:51,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801847418] [2019-12-07 19:10:51,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 19:10:51,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:51,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 19:10:51,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:10:51,288 INFO L87 Difference]: Start difference. First operand 516 states and 943 transitions. Second operand 12 states. [2019-12-07 19:10:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:51,668 INFO L93 Difference]: Finished difference Result 978 states and 1768 transitions. [2019-12-07 19:10:51,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 19:10:51,668 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-12-07 19:10:51,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:51,669 INFO L225 Difference]: With dead ends: 978 [2019-12-07 19:10:51,669 INFO L226 Difference]: Without dead ends: 471 [2019-12-07 19:10:51,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-12-07 19:10:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-07 19:10:51,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 407. [2019-12-07 19:10:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 19:10:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 753 transitions. [2019-12-07 19:10:51,673 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 753 transitions. Word has length 53 [2019-12-07 19:10:51,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:51,673 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 753 transitions. [2019-12-07 19:10:51,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 19:10:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 753 transitions. [2019-12-07 19:10:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:10:51,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:51,674 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] [2019-12-07 19:10:51,674 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:51,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash -983517111, now seen corresponding path program 1 times [2019-12-07 19:10:51,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:51,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36327893] [2019-12-07 19:10:51,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:51,716 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:10:51,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36327893] [2019-12-07 19:10:51,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:51,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:10:51,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670294803] [2019-12-07 19:10:51,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:10:51,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:51,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:10:51,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:10:51,717 INFO L87 Difference]: Start difference. First operand 407 states and 753 transitions. Second operand 3 states. [2019-12-07 19:10:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:51,726 INFO L93 Difference]: Finished difference Result 357 states and 640 transitions. [2019-12-07 19:10:51,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:10:51,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 19:10:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:51,727 INFO L225 Difference]: With dead ends: 357 [2019-12-07 19:10:51,727 INFO L226 Difference]: Without dead ends: 357 [2019-12-07 19:10:51,727 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:10:51,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-07 19:10:51,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2019-12-07 19:10:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-12-07 19:10:51,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 640 transitions. [2019-12-07 19:10:51,731 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 640 transitions. Word has length 53 [2019-12-07 19:10:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:51,731 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 640 transitions. [2019-12-07 19:10:51,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:10:51,731 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 640 transitions. [2019-12-07 19:10:51,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:10:51,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:51,732 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] [2019-12-07 19:10:51,732 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:51,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:51,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1828454951, now seen corresponding path program 2 times [2019-12-07 19:10:51,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:51,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682947160] [2019-12-07 19:10:51,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:51,852 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:10:51,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682947160] [2019-12-07 19:10:51,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:51,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:10:51,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321166611] [2019-12-07 19:10:51,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:10:51,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:51,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:10:51,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:10:51,853 INFO L87 Difference]: Start difference. First operand 357 states and 640 transitions. Second operand 9 states. [2019-12-07 19:10:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:52,119 INFO L93 Difference]: Finished difference Result 396 states and 664 transitions. [2019-12-07 19:10:52,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 19:10:52,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-07 19:10:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:52,120 INFO L225 Difference]: With dead ends: 396 [2019-12-07 19:10:52,120 INFO L226 Difference]: Without dead ends: 396 [2019-12-07 19:10:52,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:10:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-12-07 19:10:52,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 255. [2019-12-07 19:10:52,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 19:10:52,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 432 transitions. [2019-12-07 19:10:52,123 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 432 transitions. Word has length 53 [2019-12-07 19:10:52,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:52,123 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 432 transitions. [2019-12-07 19:10:52,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:10:52,123 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 432 transitions. [2019-12-07 19:10:52,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:10:52,124 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:52,124 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] [2019-12-07 19:10:52,124 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:52,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:52,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1114856101, now seen corresponding path program 3 times [2019-12-07 19:10:52,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:52,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772327836] [2019-12-07 19:10:52,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:52,157 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:10:52,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772327836] [2019-12-07 19:10:52,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:52,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:10:52,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036777461] [2019-12-07 19:10:52,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:10:52,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:52,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:10:52,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:10:52,159 INFO L87 Difference]: Start difference. First operand 255 states and 432 transitions. Second operand 3 states. [2019-12-07 19:10:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:52,183 INFO L93 Difference]: Finished difference Result 255 states and 431 transitions. [2019-12-07 19:10:52,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:10:52,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 19:10:52,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:52,184 INFO L225 Difference]: With dead ends: 255 [2019-12-07 19:10:52,184 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 19:10:52,184 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:10:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 19:10:52,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 206. [2019-12-07 19:10:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-12-07 19:10:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-12-07 19:10:52,186 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 53 [2019-12-07 19:10:52,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:52,186 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-12-07 19:10:52,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:10:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-12-07 19:10:52,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:10:52,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:52,187 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] [2019-12-07 19:10:52,187 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:52,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:52,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1034362442, now seen corresponding path program 1 times [2019-12-07 19:10:52,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:52,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916137455] [2019-12-07 19:10:52,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:52,392 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:10:52,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916137455] [2019-12-07 19:10:52,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:52,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 19:10:52,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021899731] [2019-12-07 19:10:52,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 19:10:52,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:52,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 19:10:52,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:10:52,394 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 14 states. [2019-12-07 19:10:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:52,746 INFO L93 Difference]: Finished difference Result 367 states and 610 transitions. [2019-12-07 19:10:52,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 19:10:52,746 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-07 19:10:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:52,746 INFO L225 Difference]: With dead ends: 367 [2019-12-07 19:10:52,747 INFO L226 Difference]: Without dead ends: 332 [2019-12-07 19:10:52,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-12-07 19:10:52,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-07 19:10:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 302. [2019-12-07 19:10:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-12-07 19:10:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 511 transitions. [2019-12-07 19:10:52,749 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 511 transitions. Word has length 54 [2019-12-07 19:10:52,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:52,750 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 511 transitions. [2019-12-07 19:10:52,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 19:10:52,750 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 511 transitions. [2019-12-07 19:10:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:10:52,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:52,750 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] [2019-12-07 19:10:52,750 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:52,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:52,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1623394108, now seen corresponding path program 2 times [2019-12-07 19:10:52,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:52,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558221115] [2019-12-07 19:10:52,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:52,899 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:10:52,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558221115] [2019-12-07 19:10:52,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:52,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 19:10:52,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442488053] [2019-12-07 19:10:52,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 19:10:52,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:52,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 19:10:52,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:10:52,901 INFO L87 Difference]: Start difference. First operand 302 states and 511 transitions. Second operand 13 states. [2019-12-07 19:10:53,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:53,147 INFO L93 Difference]: Finished difference Result 421 states and 693 transitions. [2019-12-07 19:10:53,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 19:10:53,147 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-07 19:10:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:53,147 INFO L225 Difference]: With dead ends: 421 [2019-12-07 19:10:53,147 INFO L226 Difference]: Without dead ends: 388 [2019-12-07 19:10:53,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-07 19:10:53,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-12-07 19:10:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 306. [2019-12-07 19:10:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-12-07 19:10:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 518 transitions. [2019-12-07 19:10:53,150 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 518 transitions. Word has length 54 [2019-12-07 19:10:53,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:53,151 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 518 transitions. [2019-12-07 19:10:53,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 19:10:53,151 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 518 transitions. [2019-12-07 19:10:53,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:10:53,151 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:53,151 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] [2019-12-07 19:10:53,151 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:53,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:53,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1326135034, now seen corresponding path program 3 times [2019-12-07 19:10:53,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:53,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892697154] [2019-12-07 19:10:53,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:10:53,304 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:10:53,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892697154] [2019-12-07 19:10:53,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:10:53,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 19:10:53,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938770283] [2019-12-07 19:10:53,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 19:10:53,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:10:53,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 19:10:53,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:10:53,306 INFO L87 Difference]: Start difference. First operand 306 states and 518 transitions. Second operand 12 states. [2019-12-07 19:10:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:10:53,547 INFO L93 Difference]: Finished difference Result 411 states and 675 transitions. [2019-12-07 19:10:53,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 19:10:53,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-07 19:10:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:10:53,548 INFO L225 Difference]: With dead ends: 411 [2019-12-07 19:10:53,548 INFO L226 Difference]: Without dead ends: 376 [2019-12-07 19:10:53,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-07 19:10:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-12-07 19:10:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 314. [2019-12-07 19:10:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-07 19:10:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 532 transitions. [2019-12-07 19:10:53,551 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 532 transitions. Word has length 54 [2019-12-07 19:10:53,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:10:53,551 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 532 transitions. [2019-12-07 19:10:53,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 19:10:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 532 transitions. [2019-12-07 19:10:53,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:10:53,551 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:10:53,551 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] [2019-12-07 19:10:53,551 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:10:53,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:10:53,552 INFO L82 PathProgramCache]: Analyzing trace with hash -91775718, now seen corresponding path program 4 times [2019-12-07 19:10:53,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:10:53,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051840616] [2019-12-07 19:10:53,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:10:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:10:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:10:53,625 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:10:53,625 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:10:53,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff1_thd0~0_329 0) (= v_~y$w_buff0_used~0_834 0) (= 0 |v_ULTIMATE.start_main_~#t2017~0.offset_19|) (= 0 v_~__unbuffered_cnt~0_61) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2017~0.base_24| 1)) (= 0 v_~weak$$choice0~0_14) (= v_~y$r_buff1_thd1~0_200 0) (= 0 v_~x~0_147) (= |v_#NULL.offset_3| 0) (= v_~main$tmp_guard1~0_27 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2017~0.base_24|) (= 0 v_~y$r_buff1_thd2~0_208) (= 0 v_~y$r_buff0_thd2~0_162) (= v_~y$mem_tmp~0_19 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2017~0.base_24|)) (= v_~weak$$choice2~0_141 0) (= v_~y$w_buff1_used~0_547 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2017~0.base_24| 4) |v_#length_13|) (= v_~y$r_buff0_thd1~0_297 0) (= 0 v_~y$flush_delayed~0_36) (= v_~main$tmp_guard0~0_33 0) (= 0 |v_#NULL.base_3|) (= 0 v_~y$w_buff0~0_485) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff0_thd0~0_416 0) (= v_~y~0_146 0) (< 0 |v_#StackHeapBarrier_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2017~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2017~0.base_24|) |v_ULTIMATE.start_main_~#t2017~0.offset_19| 0)) |v_#memory_int_11|) (= v_~y$w_buff1~0_308 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_41|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_145|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_297, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, ULTIMATE.start_main_~#t2017~0.base=|v_ULTIMATE.start_main_~#t2017~0.base_24|, #length=|v_#length_13|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_36|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_21|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_41|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_44|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_38|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_308, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_329, ~x~0=v_~x~0_147, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_834, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_33|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_200, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y~0=v_~y~0_146, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_27|, ULTIMATE.start_main_~#t2018~0.offset=|v_ULTIMATE.start_main_~#t2018~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_35|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_208, ULTIMATE.start_main_~#t2018~0.base=|v_ULTIMATE.start_main_~#t2018~0.base_19|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_416, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2017~0.offset=|v_ULTIMATE.start_main_~#t2017~0.offset_19|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_14|, ~weak$$choice2~0=v_~weak$$choice2~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2017~0.base, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t2018~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t2018~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t2017~0.offset, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 19:10:53,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L779-1-->L781: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2018~0.base_11|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2018~0.base_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2018~0.base_11|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2018~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2018~0.base_11|) |v_ULTIMATE.start_main_~#t2018~0.offset_10| 1))) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2018~0.base_11| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2018~0.base_11| 1) |v_#valid_27|) (= 0 |v_ULTIMATE.start_main_~#t2018~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2018~0.base=|v_ULTIMATE.start_main_~#t2018~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ULTIMATE.start_main_~#t2018~0.offset=|v_ULTIMATE.start_main_~#t2018~0.offset_10|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2018~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2018~0.offset, #length] because there is no mapped edge [2019-12-07 19:10:53,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1~0_121 v_~y$w_buff0~0_204) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_98 0)) (= v_P0Thread1of1ForFork0_~arg.base_94 |v_P0Thread1of1ForFork0_#in~arg.base_96|) (= 2 v_~y$w_buff0~0_203) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_94| (ite (not (and (not (= 0 (mod v_~y$w_buff0_used~0_349 256))) (not (= 0 (mod v_~y$w_buff1_used~0_210 256))))) 1 0)) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_98 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_94|) (= v_P0Thread1of1ForFork0_~arg.offset_94 |v_P0Thread1of1ForFork0_#in~arg.offset_96|) (= v_~y$w_buff0_used~0_350 v_~y$w_buff1_used~0_210) (= v_~y$w_buff0_used~0_349 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_350, ~y$w_buff0~0=v_~y$w_buff0~0_204, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_349, ~y$w_buff1~0=v_~y$w_buff1~0_121, ~y$w_buff0~0=v_~y$w_buff0~0_203, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_98, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_94, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_94|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_94, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_210} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 19:10:53,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In285340816 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In285340816 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In285340816 |P1Thread1of1ForFork1_#t~ite9_Out285340816|)) (and (or .cse0 .cse1) (= ~y~0_In285340816 |P1Thread1of1ForFork1_#t~ite9_Out285340816|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In285340816, ~y$w_buff1~0=~y$w_buff1~0_In285340816, ~y~0=~y~0_In285340816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In285340816} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In285340816, ~y$w_buff1~0=~y$w_buff1~0_In285340816, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out285340816|, ~y~0=~y~0_In285340816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In285340816} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 19:10:53,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_41) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_13|, ~y~0=v_~y~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-07 19:10:53,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In490239531 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In490239531 256) 0))) (or (and (= ~y$w_buff0_used~0_In490239531 |P1Thread1of1ForFork1_#t~ite11_Out490239531|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out490239531|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In490239531, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In490239531} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In490239531, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In490239531, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out490239531|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 19:10:53,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In726151387 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In726151387 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In726151387 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In726151387 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out726151387|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In726151387 |P1Thread1of1ForFork1_#t~ite12_Out726151387|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In726151387, ~y$w_buff0_used~0=~y$w_buff0_used~0_In726151387, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In726151387, ~y$w_buff1_used~0=~y$w_buff1_used~0_In726151387} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In726151387, ~y$w_buff0_used~0=~y$w_buff0_used~0_In726151387, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In726151387, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out726151387|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In726151387} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 19:10:53,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2099141792 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2099141792 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-2099141792| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-2099141792| ~y$r_buff0_thd2~0_In-2099141792)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099141792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2099141792} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099141792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2099141792, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-2099141792|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 19:10:53,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In153792413 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In153792413 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In153792413 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In153792413 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out153792413|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out153792413| ~y$r_buff1_thd2~0_In153792413) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In153792413, ~y$w_buff0_used~0=~y$w_buff0_used~0_In153792413, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In153792413, ~y$w_buff1_used~0=~y$w_buff1_used~0_In153792413} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In153792413, ~y$w_buff0_used~0=~y$w_buff0_used~0_In153792413, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In153792413, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out153792413|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In153792413} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 19:10:53,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L760-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~y$r_buff1_thd2~0_91) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_91, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 19:10:53,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-312782863 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-312782863 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-312782863| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-312782863| ~y$w_buff0_used~0_In-312782863)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-312782863, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-312782863} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-312782863|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-312782863, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-312782863} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 19:10:53,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1322964099 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-1322964099 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1322964099 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1322964099 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1322964099| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1322964099| ~y$w_buff1_used~0_In-1322964099) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1322964099, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1322964099, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1322964099, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1322964099} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1322964099|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1322964099, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1322964099, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1322964099, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1322964099} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 19:10:53,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In287658335 256))) (.cse2 (= ~y$r_buff0_thd1~0_Out287658335 ~y$r_buff0_thd1~0_In287658335)) (.cse0 (= (mod ~y$w_buff0_used~0_In287658335 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out287658335 0) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In287658335, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In287658335} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In287658335, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out287658335|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out287658335} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:10:53,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1591460477 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1591460477 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1591460477 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1591460477 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1591460477| ~y$r_buff1_thd1~0_In1591460477)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out1591460477| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1591460477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1591460477, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1591460477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1591460477} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1591460477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1591460477, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1591460477|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1591460477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1591460477} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 19:10:53,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L740-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 19:10:53,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 19:10:53,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-330420658 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-330420658 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite17_Out-330420658| |ULTIMATE.start_main_#t~ite18_Out-330420658|))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out-330420658| ~y$w_buff1~0_In-330420658) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite17_Out-330420658| ~y~0_In-330420658)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-330420658, ~y~0=~y~0_In-330420658, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-330420658, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-330420658} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-330420658|, ~y$w_buff1~0=~y$w_buff1~0_In-330420658, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-330420658|, ~y~0=~y~0_In-330420658, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-330420658, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-330420658} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-07 19:10:53,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In921858577 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In921858577 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite19_Out921858577|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In921858577 |ULTIMATE.start_main_#t~ite19_Out921858577|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In921858577, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In921858577} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In921858577, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out921858577|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In921858577} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-07 19:10:53,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In352854303 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In352854303 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In352854303 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In352854303 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out352854303| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite20_Out352854303| ~y$w_buff1_used~0_In352854303)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In352854303, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In352854303, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In352854303, ~y$w_buff1_used~0=~y$w_buff1_used~0_In352854303} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In352854303, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In352854303, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out352854303|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In352854303, ~y$w_buff1_used~0=~y$w_buff1_used~0_In352854303} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 19:10:53,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2055579561 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2055579561 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out2055579561|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In2055579561 |ULTIMATE.start_main_#t~ite21_Out2055579561|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2055579561, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2055579561} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2055579561, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2055579561, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out2055579561|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 19:10:53,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-881124147 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-881124147 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-881124147 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-881124147 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-881124147| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite22_Out-881124147| ~y$r_buff1_thd0~0_In-881124147)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-881124147, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-881124147, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-881124147, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-881124147} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-881124147, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-881124147, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-881124147, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-881124147|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-881124147} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 19:10:53,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2050416488 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite31_In-2050416488| |ULTIMATE.start_main_#t~ite31_Out-2050416488|) (= ~y$w_buff1~0_In-2050416488 |ULTIMATE.start_main_#t~ite32_Out-2050416488|)) (and (= ~y$w_buff1~0_In-2050416488 |ULTIMATE.start_main_#t~ite31_Out-2050416488|) (= |ULTIMATE.start_main_#t~ite32_Out-2050416488| |ULTIMATE.start_main_#t~ite31_Out-2050416488|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2050416488 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-2050416488 256) 0) (and (= (mod ~y$r_buff1_thd0~0_In-2050416488 256) 0) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-2050416488 256)) .cse1))) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2050416488, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2050416488, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2050416488, ~weak$$choice2~0=~weak$$choice2~0_In-2050416488, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-2050416488|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2050416488, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2050416488} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-2050416488, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2050416488, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2050416488, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-2050416488|, ~weak$$choice2~0=~weak$$choice2~0_In-2050416488, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-2050416488|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2050416488, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2050416488} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-07 19:10:53,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (= v_~y$r_buff0_thd0~0_162 v_~y$r_buff0_thd0~0_163) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-07 19:10:53,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_12 256)) (not (= 0 (mod v_~y$flush_delayed~0_25 256))) (= v_~y~0_106 v_~y$mem_tmp~0_13)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_106, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:10:53,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 19:10:53,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:10:53 BasicIcfg [2019-12-07 19:10:53,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:10:53,677 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:10:53,677 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:10:53,677 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:10:53,677 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:10:43" (3/4) ... [2019-12-07 19:10:53,679 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:10:53,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff1_thd0~0_329 0) (= v_~y$w_buff0_used~0_834 0) (= 0 |v_ULTIMATE.start_main_~#t2017~0.offset_19|) (= 0 v_~__unbuffered_cnt~0_61) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2017~0.base_24| 1)) (= 0 v_~weak$$choice0~0_14) (= v_~y$r_buff1_thd1~0_200 0) (= 0 v_~x~0_147) (= |v_#NULL.offset_3| 0) (= v_~main$tmp_guard1~0_27 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2017~0.base_24|) (= 0 v_~y$r_buff1_thd2~0_208) (= 0 v_~y$r_buff0_thd2~0_162) (= v_~y$mem_tmp~0_19 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2017~0.base_24|)) (= v_~weak$$choice2~0_141 0) (= v_~y$w_buff1_used~0_547 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2017~0.base_24| 4) |v_#length_13|) (= v_~y$r_buff0_thd1~0_297 0) (= 0 v_~y$flush_delayed~0_36) (= v_~main$tmp_guard0~0_33 0) (= 0 |v_#NULL.base_3|) (= 0 v_~y$w_buff0~0_485) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff0_thd0~0_416 0) (= v_~y~0_146 0) (< 0 |v_#StackHeapBarrier_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2017~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2017~0.base_24|) |v_ULTIMATE.start_main_~#t2017~0.offset_19| 0)) |v_#memory_int_11|) (= v_~y$w_buff1~0_308 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_41|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_145|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_297, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, ULTIMATE.start_main_~#t2017~0.base=|v_ULTIMATE.start_main_~#t2017~0.base_24|, #length=|v_#length_13|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_36|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_21|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_41|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_44|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_38|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_308, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_329, ~x~0=v_~x~0_147, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_834, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_33|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_200, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y~0=v_~y~0_146, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_27|, ULTIMATE.start_main_~#t2018~0.offset=|v_ULTIMATE.start_main_~#t2018~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_35|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_208, ULTIMATE.start_main_~#t2018~0.base=|v_ULTIMATE.start_main_~#t2018~0.base_19|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_416, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2017~0.offset=|v_ULTIMATE.start_main_~#t2017~0.offset_19|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_14|, ~weak$$choice2~0=v_~weak$$choice2~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2017~0.base, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t2018~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t2018~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t2017~0.offset, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 19:10:53,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L779-1-->L781: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2018~0.base_11|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2018~0.base_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2018~0.base_11|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2018~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2018~0.base_11|) |v_ULTIMATE.start_main_~#t2018~0.offset_10| 1))) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2018~0.base_11| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2018~0.base_11| 1) |v_#valid_27|) (= 0 |v_ULTIMATE.start_main_~#t2018~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2018~0.base=|v_ULTIMATE.start_main_~#t2018~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ULTIMATE.start_main_~#t2018~0.offset=|v_ULTIMATE.start_main_~#t2018~0.offset_10|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2018~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2018~0.offset, #length] because there is no mapped edge [2019-12-07 19:10:53,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1~0_121 v_~y$w_buff0~0_204) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_98 0)) (= v_P0Thread1of1ForFork0_~arg.base_94 |v_P0Thread1of1ForFork0_#in~arg.base_96|) (= 2 v_~y$w_buff0~0_203) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_94| (ite (not (and (not (= 0 (mod v_~y$w_buff0_used~0_349 256))) (not (= 0 (mod v_~y$w_buff1_used~0_210 256))))) 1 0)) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_98 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_94|) (= v_P0Thread1of1ForFork0_~arg.offset_94 |v_P0Thread1of1ForFork0_#in~arg.offset_96|) (= v_~y$w_buff0_used~0_350 v_~y$w_buff1_used~0_210) (= v_~y$w_buff0_used~0_349 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_350, ~y$w_buff0~0=v_~y$w_buff0~0_204, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_349, ~y$w_buff1~0=v_~y$w_buff1~0_121, ~y$w_buff0~0=v_~y$w_buff0~0_203, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_98, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_94, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_94|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_94, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_210} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 19:10:53,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In285340816 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In285340816 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In285340816 |P1Thread1of1ForFork1_#t~ite9_Out285340816|)) (and (or .cse0 .cse1) (= ~y~0_In285340816 |P1Thread1of1ForFork1_#t~ite9_Out285340816|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In285340816, ~y$w_buff1~0=~y$w_buff1~0_In285340816, ~y~0=~y~0_In285340816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In285340816} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In285340816, ~y$w_buff1~0=~y$w_buff1~0_In285340816, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out285340816|, ~y~0=~y~0_In285340816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In285340816} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 19:10:53,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_41) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_13|, ~y~0=v_~y~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-07 19:10:53,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In490239531 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In490239531 256) 0))) (or (and (= ~y$w_buff0_used~0_In490239531 |P1Thread1of1ForFork1_#t~ite11_Out490239531|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out490239531|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In490239531, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In490239531} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In490239531, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In490239531, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out490239531|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 19:10:53,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In726151387 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In726151387 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In726151387 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In726151387 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out726151387|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In726151387 |P1Thread1of1ForFork1_#t~ite12_Out726151387|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In726151387, ~y$w_buff0_used~0=~y$w_buff0_used~0_In726151387, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In726151387, ~y$w_buff1_used~0=~y$w_buff1_used~0_In726151387} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In726151387, ~y$w_buff0_used~0=~y$w_buff0_used~0_In726151387, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In726151387, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out726151387|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In726151387} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 19:10:53,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2099141792 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2099141792 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-2099141792| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-2099141792| ~y$r_buff0_thd2~0_In-2099141792)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099141792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2099141792} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099141792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2099141792, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-2099141792|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 19:10:53,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In153792413 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In153792413 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In153792413 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In153792413 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out153792413|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out153792413| ~y$r_buff1_thd2~0_In153792413) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In153792413, ~y$w_buff0_used~0=~y$w_buff0_used~0_In153792413, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In153792413, ~y$w_buff1_used~0=~y$w_buff1_used~0_In153792413} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In153792413, ~y$w_buff0_used~0=~y$w_buff0_used~0_In153792413, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In153792413, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out153792413|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In153792413} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 19:10:53,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L760-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~y$r_buff1_thd2~0_91) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_91, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 19:10:53,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-312782863 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-312782863 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-312782863| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-312782863| ~y$w_buff0_used~0_In-312782863)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-312782863, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-312782863} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-312782863|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-312782863, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-312782863} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 19:10:53,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1322964099 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-1322964099 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1322964099 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1322964099 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1322964099| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1322964099| ~y$w_buff1_used~0_In-1322964099) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1322964099, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1322964099, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1322964099, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1322964099} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1322964099|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1322964099, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1322964099, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1322964099, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1322964099} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 19:10:53,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In287658335 256))) (.cse2 (= ~y$r_buff0_thd1~0_Out287658335 ~y$r_buff0_thd1~0_In287658335)) (.cse0 (= (mod ~y$w_buff0_used~0_In287658335 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out287658335 0) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In287658335, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In287658335} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In287658335, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out287658335|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out287658335} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:10:53,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1591460477 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1591460477 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1591460477 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1591460477 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1591460477| ~y$r_buff1_thd1~0_In1591460477)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out1591460477| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1591460477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1591460477, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1591460477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1591460477} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1591460477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1591460477, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1591460477|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1591460477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1591460477} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 19:10:53,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L740-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 19:10:53,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 19:10:53,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-330420658 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-330420658 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite17_Out-330420658| |ULTIMATE.start_main_#t~ite18_Out-330420658|))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out-330420658| ~y$w_buff1~0_In-330420658) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite17_Out-330420658| ~y~0_In-330420658)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-330420658, ~y~0=~y~0_In-330420658, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-330420658, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-330420658} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-330420658|, ~y$w_buff1~0=~y$w_buff1~0_In-330420658, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-330420658|, ~y~0=~y~0_In-330420658, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-330420658, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-330420658} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-07 19:10:53,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In921858577 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In921858577 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite19_Out921858577|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In921858577 |ULTIMATE.start_main_#t~ite19_Out921858577|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In921858577, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In921858577} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In921858577, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out921858577|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In921858577} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-07 19:10:53,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In352854303 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In352854303 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In352854303 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In352854303 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out352854303| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite20_Out352854303| ~y$w_buff1_used~0_In352854303)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In352854303, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In352854303, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In352854303, ~y$w_buff1_used~0=~y$w_buff1_used~0_In352854303} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In352854303, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In352854303, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out352854303|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In352854303, ~y$w_buff1_used~0=~y$w_buff1_used~0_In352854303} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 19:10:53,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2055579561 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2055579561 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out2055579561|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In2055579561 |ULTIMATE.start_main_#t~ite21_Out2055579561|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2055579561, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2055579561} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2055579561, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2055579561, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out2055579561|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 19:10:53,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-881124147 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-881124147 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-881124147 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-881124147 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-881124147| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite22_Out-881124147| ~y$r_buff1_thd0~0_In-881124147)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-881124147, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-881124147, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-881124147, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-881124147} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-881124147, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-881124147, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-881124147, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-881124147|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-881124147} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 19:10:53,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2050416488 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite31_In-2050416488| |ULTIMATE.start_main_#t~ite31_Out-2050416488|) (= ~y$w_buff1~0_In-2050416488 |ULTIMATE.start_main_#t~ite32_Out-2050416488|)) (and (= ~y$w_buff1~0_In-2050416488 |ULTIMATE.start_main_#t~ite31_Out-2050416488|) (= |ULTIMATE.start_main_#t~ite32_Out-2050416488| |ULTIMATE.start_main_#t~ite31_Out-2050416488|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2050416488 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-2050416488 256) 0) (and (= (mod ~y$r_buff1_thd0~0_In-2050416488 256) 0) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-2050416488 256)) .cse1))) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2050416488, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2050416488, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2050416488, ~weak$$choice2~0=~weak$$choice2~0_In-2050416488, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-2050416488|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2050416488, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2050416488} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-2050416488, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2050416488, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2050416488, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-2050416488|, ~weak$$choice2~0=~weak$$choice2~0_In-2050416488, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-2050416488|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2050416488, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2050416488} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-07 19:10:53,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (= v_~y$r_buff0_thd0~0_162 v_~y$r_buff0_thd0~0_163) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-07 19:10:53,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_12 256)) (not (= 0 (mod v_~y$flush_delayed~0_25 256))) (= v_~y~0_106 v_~y$mem_tmp~0_13)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_106, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:10:53,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 19:10:53,735 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5f137b95-8a06-4550-b395-ec5615bb472a/bin/utaipan/witness.graphml [2019-12-07 19:10:53,735 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:10:53,736 INFO L168 Benchmark]: Toolchain (without parser) took 10570.03 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 384.8 MB). Free memory was 936.2 MB in the beginning and 850.9 MB in the end (delta: 85.3 MB). Peak memory consumption was 470.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:10:53,736 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:10:53,737 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -124.9 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:10:53,737 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.34 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:10:53,737 INFO L168 Benchmark]: Boogie Preprocessor took 23.09 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:10:53,737 INFO L168 Benchmark]: RCFGBuilder took 375.93 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: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. [2019-12-07 19:10:53,738 INFO L168 Benchmark]: TraceAbstraction took 9703.69 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 294.1 MB). Free memory was 1.0 GB in the beginning and 864.7 MB in the end (delta: 140.0 MB). Peak memory consumption was 434.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:10:53,738 INFO L168 Benchmark]: Witness Printer took 58.54 ms. Allocated memory is still 1.4 GB. Free memory was 864.7 MB in the beginning and 850.9 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:10:53,739 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 367.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -124.9 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.34 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 23.09 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 375.93 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: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9703.69 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 294.1 MB). Free memory was 1.0 GB in the beginning and 864.7 MB in the end (delta: 140.0 MB). Peak memory consumption was 434.1 MB. Max. memory is 11.5 GB. * Witness Printer took 58.54 ms. Allocated memory is still 1.4 GB. Free memory was 864.7 MB in the beginning and 850.9 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 146 ProgramPointsBefore, 79 ProgramPointsAfterwards, 180 TransitionsBefore, 91 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 3678 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 69 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 46090 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2017, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2018, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1777 SDtfs, 1702 SDslu, 4854 SDs, 0 SdLazy, 3296 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 28 SyntacticMatches, 18 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14186occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 9913 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 642 ConstructedInterpolants, 0 QuantifiedInterpolants, 134805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...