./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_power.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_16239d5c-95a8-4e33-8b48-2f88adfad9bc/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_16239d5c-95a8-4e33-8b48-2f88adfad9bc/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_16239d5c-95a8-4e33-8b48-2f88adfad9bc/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_16239d5c-95a8-4e33-8b48-2f88adfad9bc/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_16239d5c-95a8-4e33-8b48-2f88adfad9bc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_16239d5c-95a8-4e33-8b48-2f88adfad9bc/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 acec2d8ff98ffb0b89db33c8f53b9578d382c52c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:18:53,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:18:53,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:18:53,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:18:53,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:18:53,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:18:53,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:18:53,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:18:53,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:18:53,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:18:53,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:18:53,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:18:53,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:18:53,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:18:53,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:18:53,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:18:53,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:18:53,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:18:53,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:18:53,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:18:53,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:18:53,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:18:53,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:18:53,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:18:53,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:18:53,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:18:53,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:18:53,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:18:53,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:18:53,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:18:53,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:18:53,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:18:53,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:18:53,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:18:53,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:18:53,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:18:53,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:18:53,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:18:53,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:18:53,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:18:53,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:18:53,546 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_16239d5c-95a8-4e33-8b48-2f88adfad9bc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 10:18:53,557 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:18:53,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:18:53,557 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:18:53,557 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:18:53,558 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:18:53,558 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:18:53,558 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 10:18:53,558 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:18:53,558 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:18:53,558 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 10:18:53,558 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 10:18:53,558 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:18:53,559 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 10:18:53,559 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 10:18:53,559 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 10:18:53,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:18:53,559 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:18:53,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:18:53,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:18:53,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:18:53,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:18:53,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:18:53,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:18:53,560 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:18:53,560 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:18:53,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:18:53,561 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:18:53,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:18:53,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:18:53,561 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:18:53,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:18:53,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:18:53,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:18:53,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:18:53,562 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:18:53,562 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 10:18:53,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:18:53,562 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:18:53,562 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:18:53,562 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:18:53,562 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_16239d5c-95a8-4e33-8b48-2f88adfad9bc/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 -> acec2d8ff98ffb0b89db33c8f53b9578d382c52c [2019-12-07 10:18:53,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:18:53,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:18:53,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:18:53,676 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:18:53,677 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:18:53,677 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_16239d5c-95a8-4e33-8b48-2f88adfad9bc/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix028_power.oepc.i [2019-12-07 10:18:53,716 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_16239d5c-95a8-4e33-8b48-2f88adfad9bc/bin/utaipan/data/d0e95e93f/0563be4e84974bb7af4e22a2eb2caa92/FLAG133b07849 [2019-12-07 10:18:54,174 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:18:54,174 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_16239d5c-95a8-4e33-8b48-2f88adfad9bc/sv-benchmarks/c/pthread-wmm/mix028_power.oepc.i [2019-12-07 10:18:54,186 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_16239d5c-95a8-4e33-8b48-2f88adfad9bc/bin/utaipan/data/d0e95e93f/0563be4e84974bb7af4e22a2eb2caa92/FLAG133b07849 [2019-12-07 10:18:54,195 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_16239d5c-95a8-4e33-8b48-2f88adfad9bc/bin/utaipan/data/d0e95e93f/0563be4e84974bb7af4e22a2eb2caa92 [2019-12-07 10:18:54,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:18:54,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:18:54,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:18:54,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:18:54,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:18:54,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:18:54" (1/1) ... [2019-12-07 10:18:54,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:54, skipping insertion in model container [2019-12-07 10:18:54,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:18:54" (1/1) ... [2019-12-07 10:18:54,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:18:54,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:18:54,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:18:54,491 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:18:54,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:18:54,581 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:18:54,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:54 WrapperNode [2019-12-07 10:18:54,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:18:54,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:18:54,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:18:54,582 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:18:54,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:54" (1/1) ... [2019-12-07 10:18:54,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:54" (1/1) ... [2019-12-07 10:18:54,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:18:54,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:18:54,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:18:54,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:18:54,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:54" (1/1) ... [2019-12-07 10:18:54,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:54" (1/1) ... [2019-12-07 10:18:54,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:54" (1/1) ... [2019-12-07 10:18:54,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:54" (1/1) ... [2019-12-07 10:18:54,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:54" (1/1) ... [2019-12-07 10:18:54,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:54" (1/1) ... [2019-12-07 10:18:54,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:54" (1/1) ... [2019-12-07 10:18:54,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:18:54,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:18:54,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:18:54,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:18:54,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16239d5c-95a8-4e33-8b48-2f88adfad9bc/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 10:18:54,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:18:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:18:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:18:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:18:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:18:54,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:18:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:18:54,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:18:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:18:54,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:18:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:18:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:18:54,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:18:54,688 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 10:18:55,050 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:18:55,050 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:18:55,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:18:55 BoogieIcfgContainer [2019-12-07 10:18:55,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:18:55,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:18:55,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:18:55,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:18:55,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:18:54" (1/3) ... [2019-12-07 10:18:55,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a562ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:18:55, skipping insertion in model container [2019-12-07 10:18:55,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:54" (2/3) ... [2019-12-07 10:18:55,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a562ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:18:55, skipping insertion in model container [2019-12-07 10:18:55,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:18:55" (3/3) ... [2019-12-07 10:18:55,056 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc.i [2019-12-07 10:18:55,062 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:18:55,063 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:18:55,068 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:18:55,069 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:18:55,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,098 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,098 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,098 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,099 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,099 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,104 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,104 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,109 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,110 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:55,135 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:18:55,148 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:18:55,148 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:18:55,148 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:18:55,148 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:18:55,148 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:18:55,148 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:18:55,148 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:18:55,149 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:18:55,162 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-07 10:18:55,163 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-07 10:18:55,219 INFO L134 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-07 10:18:55,220 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:18:55,231 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 682 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 10:18:55,247 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-07 10:18:55,286 INFO L134 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-07 10:18:55,286 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:18:55,292 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 682 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 10:18:55,308 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 10:18:55,309 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:18:58,518 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-12-07 10:18:58,836 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 10:18:58,920 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87070 [2019-12-07 10:18:58,920 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-07 10:18:58,922 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-07 10:19:13,381 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-07 10:19:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-07 10:19:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 10:19:13,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:13,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 10:19:13,387 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:13,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:13,391 INFO L82 PathProgramCache]: Analyzing trace with hash 911890, now seen corresponding path program 1 times [2019-12-07 10:19:13,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:13,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695781743] [2019-12-07 10:19:13,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:13,526 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 10:19:13,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695781743] [2019-12-07 10:19:13,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:13,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:19:13,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41786786] [2019-12-07 10:19:13,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:19:13,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:13,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:19:13,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:19:13,542 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-07 10:19:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:14,292 INFO L93 Difference]: Finished difference Result 114158 states and 484836 transitions. [2019-12-07 10:19:14,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:19:14,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 10:19:14,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:14,749 INFO L225 Difference]: With dead ends: 114158 [2019-12-07 10:19:14,749 INFO L226 Difference]: Without dead ends: 107060 [2019-12-07 10:19:14,750 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 10:19:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107060 states. [2019-12-07 10:19:21,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107060 to 107060. [2019-12-07 10:19:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107060 states. [2019-12-07 10:19:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107060 states to 107060 states and 454078 transitions. [2019-12-07 10:19:21,813 INFO L78 Accepts]: Start accepts. Automaton has 107060 states and 454078 transitions. Word has length 3 [2019-12-07 10:19:21,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:21,814 INFO L462 AbstractCegarLoop]: Abstraction has 107060 states and 454078 transitions. [2019-12-07 10:19:21,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:19:21,814 INFO L276 IsEmpty]: Start isEmpty. Operand 107060 states and 454078 transitions. [2019-12-07 10:19:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:19:21,817 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:21,818 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:21,818 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:21,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:21,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1487504284, now seen corresponding path program 1 times [2019-12-07 10:19:21,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:21,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265878503] [2019-12-07 10:19:21,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:21,889 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 10:19:21,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265878503] [2019-12-07 10:19:21,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:21,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:19:21,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668022686] [2019-12-07 10:19:21,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:19:21,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:21,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:19:21,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:19:21,891 INFO L87 Difference]: Start difference. First operand 107060 states and 454078 transitions. Second operand 4 states. [2019-12-07 10:19:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:22,787 INFO L93 Difference]: Finished difference Result 166396 states and 678148 transitions. [2019-12-07 10:19:22,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:19:22,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:19:22,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:23,630 INFO L225 Difference]: With dead ends: 166396 [2019-12-07 10:19:23,630 INFO L226 Difference]: Without dead ends: 166347 [2019-12-07 10:19:23,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 10:19:30,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166347 states. [2019-12-07 10:19:32,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166347 to 151934. [2019-12-07 10:19:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151934 states. [2019-12-07 10:19:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151934 states to 151934 states and 627001 transitions. [2019-12-07 10:19:32,612 INFO L78 Accepts]: Start accepts. Automaton has 151934 states and 627001 transitions. Word has length 11 [2019-12-07 10:19:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:32,613 INFO L462 AbstractCegarLoop]: Abstraction has 151934 states and 627001 transitions. [2019-12-07 10:19:32,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:19:32,613 INFO L276 IsEmpty]: Start isEmpty. Operand 151934 states and 627001 transitions. [2019-12-07 10:19:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:19:32,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:32,618 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:32,619 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:32,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:32,619 INFO L82 PathProgramCache]: Analyzing trace with hash 881606285, now seen corresponding path program 1 times [2019-12-07 10:19:32,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:32,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440489457] [2019-12-07 10:19:32,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:32,667 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 10:19:32,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440489457] [2019-12-07 10:19:32,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:32,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:19:32,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338229247] [2019-12-07 10:19:32,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:19:32,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:32,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:19:32,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:19:32,669 INFO L87 Difference]: Start difference. First operand 151934 states and 627001 transitions. Second operand 3 states. [2019-12-07 10:19:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:32,762 INFO L93 Difference]: Finished difference Result 33114 states and 107084 transitions. [2019-12-07 10:19:32,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:19:32,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 10:19:32,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:32,824 INFO L225 Difference]: With dead ends: 33114 [2019-12-07 10:19:32,824 INFO L226 Difference]: Without dead ends: 33114 [2019-12-07 10:19:32,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:19:32,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33114 states. [2019-12-07 10:19:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33114 to 33114. [2019-12-07 10:19:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33114 states. [2019-12-07 10:19:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33114 states to 33114 states and 107084 transitions. [2019-12-07 10:19:33,362 INFO L78 Accepts]: Start accepts. Automaton has 33114 states and 107084 transitions. Word has length 13 [2019-12-07 10:19:33,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:33,363 INFO L462 AbstractCegarLoop]: Abstraction has 33114 states and 107084 transitions. [2019-12-07 10:19:33,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:19:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 33114 states and 107084 transitions. [2019-12-07 10:19:33,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:19:33,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:33,365 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:33,365 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:33,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:33,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1702625862, now seen corresponding path program 1 times [2019-12-07 10:19:33,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:33,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975678353] [2019-12-07 10:19:33,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:33,417 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 10:19:33,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975678353] [2019-12-07 10:19:33,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:33,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:19:33,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858824674] [2019-12-07 10:19:33,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:19:33,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:33,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:19:33,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:19:33,419 INFO L87 Difference]: Start difference. First operand 33114 states and 107084 transitions. Second operand 4 states. [2019-12-07 10:19:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:33,648 INFO L93 Difference]: Finished difference Result 41561 states and 133908 transitions. [2019-12-07 10:19:33,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:19:33,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:19:33,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:33,706 INFO L225 Difference]: With dead ends: 41561 [2019-12-07 10:19:33,706 INFO L226 Difference]: Without dead ends: 41561 [2019-12-07 10:19:33,706 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 10:19:33,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41561 states. [2019-12-07 10:19:34,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41561 to 37204. [2019-12-07 10:19:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37204 states. [2019-12-07 10:19:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37204 states to 37204 states and 120245 transitions. [2019-12-07 10:19:34,728 INFO L78 Accepts]: Start accepts. Automaton has 37204 states and 120245 transitions. Word has length 16 [2019-12-07 10:19:34,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:34,729 INFO L462 AbstractCegarLoop]: Abstraction has 37204 states and 120245 transitions. [2019-12-07 10:19:34,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:19:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 37204 states and 120245 transitions. [2019-12-07 10:19:34,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:19:34,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:34,736 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:34,736 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:34,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:34,736 INFO L82 PathProgramCache]: Analyzing trace with hash -989401703, now seen corresponding path program 1 times [2019-12-07 10:19:34,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:34,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707077527] [2019-12-07 10:19:34,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:34,801 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 10:19:34,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707077527] [2019-12-07 10:19:34,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:34,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:19:34,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680356696] [2019-12-07 10:19:34,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:19:34,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:34,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:19:34,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:19:34,802 INFO L87 Difference]: Start difference. First operand 37204 states and 120245 transitions. Second operand 5 states. [2019-12-07 10:19:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:35,210 INFO L93 Difference]: Finished difference Result 47941 states and 152440 transitions. [2019-12-07 10:19:35,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:19:35,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 10:19:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:35,275 INFO L225 Difference]: With dead ends: 47941 [2019-12-07 10:19:35,275 INFO L226 Difference]: Without dead ends: 47934 [2019-12-07 10:19:35,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:19:35,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47934 states. [2019-12-07 10:19:35,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47934 to 36849. [2019-12-07 10:19:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36849 states. [2019-12-07 10:19:35,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36849 states to 36849 states and 118974 transitions. [2019-12-07 10:19:35,941 INFO L78 Accepts]: Start accepts. Automaton has 36849 states and 118974 transitions. Word has length 22 [2019-12-07 10:19:35,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:35,941 INFO L462 AbstractCegarLoop]: Abstraction has 36849 states and 118974 transitions. [2019-12-07 10:19:35,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:19:35,941 INFO L276 IsEmpty]: Start isEmpty. Operand 36849 states and 118974 transitions. [2019-12-07 10:19:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:19:35,951 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:35,951 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 10:19:35,951 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:35,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:35,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2090054503, now seen corresponding path program 1 times [2019-12-07 10:19:35,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:35,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300397916] [2019-12-07 10:19:35,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:36,014 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 10:19:36,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300397916] [2019-12-07 10:19:36,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:36,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:19:36,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292644860] [2019-12-07 10:19:36,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:19:36,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:36,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:19:36,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:19:36,016 INFO L87 Difference]: Start difference. First operand 36849 states and 118974 transitions. Second operand 5 states. [2019-12-07 10:19:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:36,397 INFO L93 Difference]: Finished difference Result 51495 states and 162925 transitions. [2019-12-07 10:19:36,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:19:36,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 10:19:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:36,474 INFO L225 Difference]: With dead ends: 51495 [2019-12-07 10:19:36,474 INFO L226 Difference]: Without dead ends: 51482 [2019-12-07 10:19:36,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:19:36,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51482 states. [2019-12-07 10:19:37,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51482 to 42847. [2019-12-07 10:19:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42847 states. [2019-12-07 10:19:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42847 states to 42847 states and 137761 transitions. [2019-12-07 10:19:37,218 INFO L78 Accepts]: Start accepts. Automaton has 42847 states and 137761 transitions. Word has length 25 [2019-12-07 10:19:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:37,218 INFO L462 AbstractCegarLoop]: Abstraction has 42847 states and 137761 transitions. [2019-12-07 10:19:37,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:19:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 42847 states and 137761 transitions. [2019-12-07 10:19:37,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:19:37,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:37,229 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:37,229 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:37,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:37,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1906532401, now seen corresponding path program 1 times [2019-12-07 10:19:37,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:37,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810615205] [2019-12-07 10:19:37,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:37,252 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 10:19:37,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810615205] [2019-12-07 10:19:37,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:37,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:19:37,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556131648] [2019-12-07 10:19:37,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:19:37,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:37,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:19:37,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:19:37,254 INFO L87 Difference]: Start difference. First operand 42847 states and 137761 transitions. Second operand 3 states. [2019-12-07 10:19:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:37,421 INFO L93 Difference]: Finished difference Result 60912 states and 194032 transitions. [2019-12-07 10:19:37,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:19:37,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 10:19:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:37,512 INFO L225 Difference]: With dead ends: 60912 [2019-12-07 10:19:37,512 INFO L226 Difference]: Without dead ends: 60912 [2019-12-07 10:19:37,512 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 10:19:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60912 states. [2019-12-07 10:19:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60912 to 45511. [2019-12-07 10:19:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45511 states. [2019-12-07 10:19:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45511 states to 45511 states and 145733 transitions. [2019-12-07 10:19:38,520 INFO L78 Accepts]: Start accepts. Automaton has 45511 states and 145733 transitions. Word has length 27 [2019-12-07 10:19:38,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:38,520 INFO L462 AbstractCegarLoop]: Abstraction has 45511 states and 145733 transitions. [2019-12-07 10:19:38,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:19:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 45511 states and 145733 transitions. [2019-12-07 10:19:38,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:19:38,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:38,532 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:38,532 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:38,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:38,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1466938041, now seen corresponding path program 1 times [2019-12-07 10:19:38,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:38,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459478969] [2019-12-07 10:19:38,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:38,602 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 10:19:38,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459478969] [2019-12-07 10:19:38,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:38,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:19:38,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804681382] [2019-12-07 10:19:38,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:19:38,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:38,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:19:38,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:19:38,604 INFO L87 Difference]: Start difference. First operand 45511 states and 145733 transitions. Second operand 6 states. [2019-12-07 10:19:39,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:39,324 INFO L93 Difference]: Finished difference Result 118648 states and 375865 transitions. [2019-12-07 10:19:39,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:19:39,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 10:19:39,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:39,510 INFO L225 Difference]: With dead ends: 118648 [2019-12-07 10:19:39,510 INFO L226 Difference]: Without dead ends: 118603 [2019-12-07 10:19:39,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:19:39,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118603 states. [2019-12-07 10:19:40,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118603 to 61080. [2019-12-07 10:19:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61080 states. [2019-12-07 10:19:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61080 states to 61080 states and 197935 transitions. [2019-12-07 10:19:41,145 INFO L78 Accepts]: Start accepts. Automaton has 61080 states and 197935 transitions. Word has length 27 [2019-12-07 10:19:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:41,145 INFO L462 AbstractCegarLoop]: Abstraction has 61080 states and 197935 transitions. [2019-12-07 10:19:41,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:19:41,145 INFO L276 IsEmpty]: Start isEmpty. Operand 61080 states and 197935 transitions. [2019-12-07 10:19:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:19:41,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:41,162 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:41,162 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:41,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:41,162 INFO L82 PathProgramCache]: Analyzing trace with hash 512143841, now seen corresponding path program 1 times [2019-12-07 10:19:41,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:41,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976038899] [2019-12-07 10:19:41,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:41,210 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 10:19:41,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976038899] [2019-12-07 10:19:41,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:41,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:19:41,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534018694] [2019-12-07 10:19:41,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:19:41,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:41,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:19:41,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:19:41,211 INFO L87 Difference]: Start difference. First operand 61080 states and 197935 transitions. Second operand 5 states. [2019-12-07 10:19:41,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:41,754 INFO L93 Difference]: Finished difference Result 83949 states and 269136 transitions. [2019-12-07 10:19:41,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:19:41,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 10:19:41,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:41,879 INFO L225 Difference]: With dead ends: 83949 [2019-12-07 10:19:41,880 INFO L226 Difference]: Without dead ends: 83949 [2019-12-07 10:19:41,880 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 10:19:42,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83949 states. [2019-12-07 10:19:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83949 to 72017. [2019-12-07 10:19:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72017 states. [2019-12-07 10:19:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72017 states to 72017 states and 232914 transitions. [2019-12-07 10:19:43,136 INFO L78 Accepts]: Start accepts. Automaton has 72017 states and 232914 transitions. Word has length 28 [2019-12-07 10:19:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:43,136 INFO L462 AbstractCegarLoop]: Abstraction has 72017 states and 232914 transitions. [2019-12-07 10:19:43,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:19:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 72017 states and 232914 transitions. [2019-12-07 10:19:43,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:19:43,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:43,162 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:43,162 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:43,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:43,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1177717026, now seen corresponding path program 1 times [2019-12-07 10:19:43,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:43,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662862443] [2019-12-07 10:19:43,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:43,226 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 10:19:43,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662862443] [2019-12-07 10:19:43,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:43,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:19:43,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289730996] [2019-12-07 10:19:43,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:19:43,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:43,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:19:43,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:19:43,227 INFO L87 Difference]: Start difference. First operand 72017 states and 232914 transitions. Second operand 6 states. [2019-12-07 10:19:44,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:44,051 INFO L93 Difference]: Finished difference Result 123070 states and 390345 transitions. [2019-12-07 10:19:44,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:19:44,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-07 10:19:44,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:44,244 INFO L225 Difference]: With dead ends: 123070 [2019-12-07 10:19:44,244 INFO L226 Difference]: Without dead ends: 123048 [2019-12-07 10:19:44,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:19:44,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123048 states. [2019-12-07 10:19:45,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123048 to 71772. [2019-12-07 10:19:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71772 states. [2019-12-07 10:19:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71772 states to 71772 states and 232401 transitions. [2019-12-07 10:19:46,005 INFO L78 Accepts]: Start accepts. Automaton has 71772 states and 232401 transitions. Word has length 28 [2019-12-07 10:19:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:46,006 INFO L462 AbstractCegarLoop]: Abstraction has 71772 states and 232401 transitions. [2019-12-07 10:19:46,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:19:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 71772 states and 232401 transitions. [2019-12-07 10:19:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 10:19:46,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:46,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:46,029 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:46,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:46,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1459589553, now seen corresponding path program 1 times [2019-12-07 10:19:46,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:46,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559464881] [2019-12-07 10:19:46,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:46,093 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 10:19:46,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559464881] [2019-12-07 10:19:46,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:46,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:19:46,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380164064] [2019-12-07 10:19:46,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:19:46,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:46,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:19:46,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:19:46,094 INFO L87 Difference]: Start difference. First operand 71772 states and 232401 transitions. Second operand 4 states. [2019-12-07 10:19:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:46,440 INFO L93 Difference]: Finished difference Result 133623 states and 430983 transitions. [2019-12-07 10:19:46,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:19:46,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 10:19:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:46,620 INFO L225 Difference]: With dead ends: 133623 [2019-12-07 10:19:46,621 INFO L226 Difference]: Without dead ends: 116418 [2019-12-07 10:19:46,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:19:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116418 states. [2019-12-07 10:19:48,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116418 to 113942. [2019-12-07 10:19:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113942 states. [2019-12-07 10:19:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113942 states to 113942 states and 367934 transitions. [2019-12-07 10:19:48,819 INFO L78 Accepts]: Start accepts. Automaton has 113942 states and 367934 transitions. Word has length 29 [2019-12-07 10:19:48,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:48,819 INFO L462 AbstractCegarLoop]: Abstraction has 113942 states and 367934 transitions. [2019-12-07 10:19:48,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:19:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 113942 states and 367934 transitions. [2019-12-07 10:19:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 10:19:48,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:48,860 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:48,861 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:48,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:48,861 INFO L82 PathProgramCache]: Analyzing trace with hash 361978144, now seen corresponding path program 1 times [2019-12-07 10:19:48,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:48,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344795766] [2019-12-07 10:19:48,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:48,908 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 10:19:48,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344795766] [2019-12-07 10:19:48,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:48,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:19:48,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025356535] [2019-12-07 10:19:48,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:19:48,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:48,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:19:48,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:19:48,909 INFO L87 Difference]: Start difference. First operand 113942 states and 367934 transitions. Second operand 4 states. [2019-12-07 10:19:49,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:49,469 INFO L93 Difference]: Finished difference Result 188221 states and 611907 transitions. [2019-12-07 10:19:49,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:19:49,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-07 10:19:49,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:49,610 INFO L225 Difference]: With dead ends: 188221 [2019-12-07 10:19:49,610 INFO L226 Difference]: Without dead ends: 90812 [2019-12-07 10:19:49,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:19:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90812 states. [2019-12-07 10:19:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90812 to 87955. [2019-12-07 10:19:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87955 states. [2019-12-07 10:19:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87955 states to 87955 states and 282778 transitions. [2019-12-07 10:19:51,054 INFO L78 Accepts]: Start accepts. Automaton has 87955 states and 282778 transitions. Word has length 30 [2019-12-07 10:19:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:51,054 INFO L462 AbstractCegarLoop]: Abstraction has 87955 states and 282778 transitions. [2019-12-07 10:19:51,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:19:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 87955 states and 282778 transitions. [2019-12-07 10:19:51,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 10:19:51,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:51,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:51,098 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:51,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:51,098 INFO L82 PathProgramCache]: Analyzing trace with hash -699778688, now seen corresponding path program 1 times [2019-12-07 10:19:51,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:51,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089897859] [2019-12-07 10:19:51,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:51,136 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 10:19:51,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089897859] [2019-12-07 10:19:51,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:51,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:19:51,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284197145] [2019-12-07 10:19:51,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:19:51,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:51,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:19:51,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:19:51,137 INFO L87 Difference]: Start difference. First operand 87955 states and 282778 transitions. Second operand 3 states. [2019-12-07 10:19:51,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:51,380 INFO L93 Difference]: Finished difference Result 83699 states and 266251 transitions. [2019-12-07 10:19:51,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:19:51,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 10:19:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:51,502 INFO L225 Difference]: With dead ends: 83699 [2019-12-07 10:19:51,502 INFO L226 Difference]: Without dead ends: 83699 [2019-12-07 10:19:51,502 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 10:19:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83699 states. [2019-12-07 10:19:52,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83699 to 83262. [2019-12-07 10:19:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83262 states. [2019-12-07 10:19:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83262 states to 83262 states and 264961 transitions. [2019-12-07 10:19:52,838 INFO L78 Accepts]: Start accepts. Automaton has 83262 states and 264961 transitions. Word has length 30 [2019-12-07 10:19:52,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:52,839 INFO L462 AbstractCegarLoop]: Abstraction has 83262 states and 264961 transitions. [2019-12-07 10:19:52,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:19:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 83262 states and 264961 transitions. [2019-12-07 10:19:52,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:19:52,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:52,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:52,869 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:52,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:52,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1788536026, now seen corresponding path program 1 times [2019-12-07 10:19:52,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:52,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592826475] [2019-12-07 10:19:52,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:52,904 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 10:19:52,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592826475] [2019-12-07 10:19:52,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:52,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:19:52,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881160051] [2019-12-07 10:19:52,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:19:52,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:52,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:19:52,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:19:52,906 INFO L87 Difference]: Start difference. First operand 83262 states and 264961 transitions. Second operand 4 states. [2019-12-07 10:19:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:53,004 INFO L93 Difference]: Finished difference Result 36743 states and 110056 transitions. [2019-12-07 10:19:53,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:19:53,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-07 10:19:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:53,044 INFO L225 Difference]: With dead ends: 36743 [2019-12-07 10:19:53,044 INFO L226 Difference]: Without dead ends: 36715 [2019-12-07 10:19:53,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:19:53,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36715 states. [2019-12-07 10:19:53,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36715 to 33753. [2019-12-07 10:19:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33753 states. [2019-12-07 10:19:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33753 states to 33753 states and 102354 transitions. [2019-12-07 10:19:53,507 INFO L78 Accepts]: Start accepts. Automaton has 33753 states and 102354 transitions. Word has length 31 [2019-12-07 10:19:53,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:53,507 INFO L462 AbstractCegarLoop]: Abstraction has 33753 states and 102354 transitions. [2019-12-07 10:19:53,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:19:53,508 INFO L276 IsEmpty]: Start isEmpty. Operand 33753 states and 102354 transitions. [2019-12-07 10:19:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:19:53,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:53,532 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:53,533 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:53,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:53,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1088633804, now seen corresponding path program 1 times [2019-12-07 10:19:53,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:53,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995142946] [2019-12-07 10:19:53,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:53,624 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 10:19:53,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995142946] [2019-12-07 10:19:53,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:53,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:19:53,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086659544] [2019-12-07 10:19:53,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:19:53,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:53,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:19:53,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:19:53,625 INFO L87 Difference]: Start difference. First operand 33753 states and 102354 transitions. Second operand 8 states. [2019-12-07 10:19:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:54,844 INFO L93 Difference]: Finished difference Result 66593 states and 193022 transitions. [2019-12-07 10:19:54,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 10:19:54,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-07 10:19:54,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:54,923 INFO L225 Difference]: With dead ends: 66593 [2019-12-07 10:19:54,923 INFO L226 Difference]: Without dead ends: 66593 [2019-12-07 10:19:54,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2019-12-07 10:19:55,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66593 states. [2019-12-07 10:19:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66593 to 34377. [2019-12-07 10:19:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34377 states. [2019-12-07 10:19:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34377 states to 34377 states and 104040 transitions. [2019-12-07 10:19:55,660 INFO L78 Accepts]: Start accepts. Automaton has 34377 states and 104040 transitions. Word has length 33 [2019-12-07 10:19:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:55,660 INFO L462 AbstractCegarLoop]: Abstraction has 34377 states and 104040 transitions. [2019-12-07 10:19:55,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:19:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 34377 states and 104040 transitions. [2019-12-07 10:19:55,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:19:55,687 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:55,687 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:55,687 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:55,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:55,687 INFO L82 PathProgramCache]: Analyzing trace with hash 910211148, now seen corresponding path program 2 times [2019-12-07 10:19:55,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:55,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499523897] [2019-12-07 10:19:55,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:55,770 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 10:19:55,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499523897] [2019-12-07 10:19:55,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:55,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:19:55,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646436166] [2019-12-07 10:19:55,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:19:55,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:55,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:19:55,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:19:55,772 INFO L87 Difference]: Start difference. First operand 34377 states and 104040 transitions. Second operand 7 states. [2019-12-07 10:19:56,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:56,886 INFO L93 Difference]: Finished difference Result 60655 states and 176985 transitions. [2019-12-07 10:19:56,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 10:19:56,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 10:19:56,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:56,962 INFO L225 Difference]: With dead ends: 60655 [2019-12-07 10:19:56,962 INFO L226 Difference]: Without dead ends: 60655 [2019-12-07 10:19:56,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-07 10:19:57,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60655 states. [2019-12-07 10:19:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60655 to 34519. [2019-12-07 10:19:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34519 states. [2019-12-07 10:19:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34519 states to 34519 states and 104425 transitions. [2019-12-07 10:19:57,685 INFO L78 Accepts]: Start accepts. Automaton has 34519 states and 104425 transitions. Word has length 33 [2019-12-07 10:19:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:57,685 INFO L462 AbstractCegarLoop]: Abstraction has 34519 states and 104425 transitions. [2019-12-07 10:19:57,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:19:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 34519 states and 104425 transitions. [2019-12-07 10:19:57,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:19:57,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:57,711 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:57,711 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:57,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:57,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1082826604, now seen corresponding path program 1 times [2019-12-07 10:19:57,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:57,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496484765] [2019-12-07 10:19:57,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:57,732 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 10:19:57,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496484765] [2019-12-07 10:19:57,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:57,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:19:57,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523316726] [2019-12-07 10:19:57,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:19:57,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:57,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:19:57,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:19:57,734 INFO L87 Difference]: Start difference. First operand 34519 states and 104425 transitions. Second operand 3 states. [2019-12-07 10:19:57,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:57,849 INFO L93 Difference]: Finished difference Result 42640 states and 124043 transitions. [2019-12-07 10:19:57,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:19:57,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 10:19:57,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:57,896 INFO L225 Difference]: With dead ends: 42640 [2019-12-07 10:19:57,897 INFO L226 Difference]: Without dead ends: 42640 [2019-12-07 10:19:57,897 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 10:19:58,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42640 states. [2019-12-07 10:19:58,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42640 to 30648. [2019-12-07 10:19:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30648 states. [2019-12-07 10:19:58,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30648 states to 30648 states and 89405 transitions. [2019-12-07 10:19:58,380 INFO L78 Accepts]: Start accepts. Automaton has 30648 states and 89405 transitions. Word has length 33 [2019-12-07 10:19:58,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:58,380 INFO L462 AbstractCegarLoop]: Abstraction has 30648 states and 89405 transitions. [2019-12-07 10:19:58,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:19:58,381 INFO L276 IsEmpty]: Start isEmpty. Operand 30648 states and 89405 transitions. [2019-12-07 10:19:58,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:19:58,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:58,400 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:58,400 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:58,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:58,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1090977820, now seen corresponding path program 3 times [2019-12-07 10:19:58,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:58,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436238512] [2019-12-07 10:19:58,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:58,480 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 10:19:58,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436238512] [2019-12-07 10:19:58,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:58,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:19:58,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581589595] [2019-12-07 10:19:58,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:19:58,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:19:58,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:19:58,481 INFO L87 Difference]: Start difference. First operand 30648 states and 89405 transitions. Second operand 8 states. [2019-12-07 10:19:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:59,854 INFO L93 Difference]: Finished difference Result 62801 states and 178883 transitions. [2019-12-07 10:19:59,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 10:19:59,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-07 10:19:59,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:59,920 INFO L225 Difference]: With dead ends: 62801 [2019-12-07 10:19:59,921 INFO L226 Difference]: Without dead ends: 62801 [2019-12-07 10:19:59,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-07 10:20:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62801 states. [2019-12-07 10:20:00,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62801 to 30313. [2019-12-07 10:20:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30313 states. [2019-12-07 10:20:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30313 states to 30313 states and 88509 transitions. [2019-12-07 10:20:00,552 INFO L78 Accepts]: Start accepts. Automaton has 30313 states and 88509 transitions. Word has length 33 [2019-12-07 10:20:00,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:00,552 INFO L462 AbstractCegarLoop]: Abstraction has 30313 states and 88509 transitions. [2019-12-07 10:20:00,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:20:00,552 INFO L276 IsEmpty]: Start isEmpty. Operand 30313 states and 88509 transitions. [2019-12-07 10:20:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:20:00,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:00,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:00,573 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:00,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:00,573 INFO L82 PathProgramCache]: Analyzing trace with hash 791261483, now seen corresponding path program 1 times [2019-12-07 10:20:00,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:00,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486840881] [2019-12-07 10:20:00,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:00,632 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 10:20:00,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486840881] [2019-12-07 10:20:00,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:00,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:20:00,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700020678] [2019-12-07 10:20:00,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:20:00,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:00,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:20:00,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:20:00,634 INFO L87 Difference]: Start difference. First operand 30313 states and 88509 transitions. Second operand 5 states. [2019-12-07 10:20:00,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:00,757 INFO L93 Difference]: Finished difference Result 30724 states and 89476 transitions. [2019-12-07 10:20:00,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:20:00,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 10:20:00,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:00,791 INFO L225 Difference]: With dead ends: 30724 [2019-12-07 10:20:00,791 INFO L226 Difference]: Without dead ends: 30724 [2019-12-07 10:20:00,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:20:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30724 states. [2019-12-07 10:20:01,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30724 to 30724. [2019-12-07 10:20:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30724 states. [2019-12-07 10:20:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30724 states to 30724 states and 89476 transitions. [2019-12-07 10:20:01,191 INFO L78 Accepts]: Start accepts. Automaton has 30724 states and 89476 transitions. Word has length 34 [2019-12-07 10:20:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:01,191 INFO L462 AbstractCegarLoop]: Abstraction has 30724 states and 89476 transitions. [2019-12-07 10:20:01,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:20:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 30724 states and 89476 transitions. [2019-12-07 10:20:01,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:20:01,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:01,213 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] [2019-12-07 10:20:01,214 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:01,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:01,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1352546088, now seen corresponding path program 1 times [2019-12-07 10:20:01,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:01,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168837589] [2019-12-07 10:20:01,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:01,285 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 10:20:01,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168837589] [2019-12-07 10:20:01,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:01,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:20:01,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256087113] [2019-12-07 10:20:01,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:20:01,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:01,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:20:01,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:20:01,286 INFO L87 Difference]: Start difference. First operand 30724 states and 89476 transitions. Second operand 7 states. [2019-12-07 10:20:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:01,989 INFO L93 Difference]: Finished difference Result 46431 states and 132194 transitions. [2019-12-07 10:20:01,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:20:01,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 10:20:01,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:02,037 INFO L225 Difference]: With dead ends: 46431 [2019-12-07 10:20:02,037 INFO L226 Difference]: Without dead ends: 46431 [2019-12-07 10:20:02,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:20:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46431 states. [2019-12-07 10:20:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46431 to 30293. [2019-12-07 10:20:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30293 states. [2019-12-07 10:20:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30293 states to 30293 states and 88438 transitions. [2019-12-07 10:20:02,556 INFO L78 Accepts]: Start accepts. Automaton has 30293 states and 88438 transitions. Word has length 35 [2019-12-07 10:20:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:02,556 INFO L462 AbstractCegarLoop]: Abstraction has 30293 states and 88438 transitions. [2019-12-07 10:20:02,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:20:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 30293 states and 88438 transitions. [2019-12-07 10:20:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:20:02,576 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:02,576 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] [2019-12-07 10:20:02,576 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:02,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:02,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1641645214, now seen corresponding path program 2 times [2019-12-07 10:20:02,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:02,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751495608] [2019-12-07 10:20:02,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:02,688 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 10:20:02,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751495608] [2019-12-07 10:20:02,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:02,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:20:02,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258947097] [2019-12-07 10:20:02,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:20:02,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:02,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:20:02,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:20:02,689 INFO L87 Difference]: Start difference. First operand 30293 states and 88438 transitions. Second operand 7 states. [2019-12-07 10:20:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:03,745 INFO L93 Difference]: Finished difference Result 56766 states and 159352 transitions. [2019-12-07 10:20:03,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 10:20:03,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 10:20:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:03,816 INFO L225 Difference]: With dead ends: 56766 [2019-12-07 10:20:03,816 INFO L226 Difference]: Without dead ends: 56766 [2019-12-07 10:20:03,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:20:03,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56766 states. [2019-12-07 10:20:04,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56766 to 29928. [2019-12-07 10:20:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29928 states. [2019-12-07 10:20:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29928 states to 29928 states and 87338 transitions. [2019-12-07 10:20:04,407 INFO L78 Accepts]: Start accepts. Automaton has 29928 states and 87338 transitions. Word has length 35 [2019-12-07 10:20:04,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:04,407 INFO L462 AbstractCegarLoop]: Abstraction has 29928 states and 87338 transitions. [2019-12-07 10:20:04,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:20:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 29928 states and 87338 transitions. [2019-12-07 10:20:04,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:20:04,428 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:04,428 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] [2019-12-07 10:20:04,428 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:04,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:04,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1975616128, now seen corresponding path program 3 times [2019-12-07 10:20:04,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:04,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502240452] [2019-12-07 10:20:04,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:04,519 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 10:20:04,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502240452] [2019-12-07 10:20:04,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:04,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:20:04,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030304578] [2019-12-07 10:20:04,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:20:04,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:04,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:20:04,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:20:04,520 INFO L87 Difference]: Start difference. First operand 29928 states and 87338 transitions. Second operand 9 states. [2019-12-07 10:20:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:07,573 INFO L93 Difference]: Finished difference Result 47425 states and 134910 transitions. [2019-12-07 10:20:07,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 10:20:07,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-07 10:20:07,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:07,622 INFO L225 Difference]: With dead ends: 47425 [2019-12-07 10:20:07,623 INFO L226 Difference]: Without dead ends: 47425 [2019-12-07 10:20:07,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:20:07,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47425 states. [2019-12-07 10:20:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47425 to 29375. [2019-12-07 10:20:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29375 states. [2019-12-07 10:20:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29375 states to 29375 states and 85775 transitions. [2019-12-07 10:20:08,151 INFO L78 Accepts]: Start accepts. Automaton has 29375 states and 85775 transitions. Word has length 35 [2019-12-07 10:20:08,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:08,151 INFO L462 AbstractCegarLoop]: Abstraction has 29375 states and 85775 transitions. [2019-12-07 10:20:08,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:20:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 29375 states and 85775 transitions. [2019-12-07 10:20:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 10:20:08,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:08,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:08,178 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:08,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:08,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2044650148, now seen corresponding path program 1 times [2019-12-07 10:20:08,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:08,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922193604] [2019-12-07 10:20:08,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:08,230 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 10:20:08,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922193604] [2019-12-07 10:20:08,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:08,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:20:08,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151539644] [2019-12-07 10:20:08,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:20:08,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:08,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:20:08,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:20:08,231 INFO L87 Difference]: Start difference. First operand 29375 states and 85775 transitions. Second operand 3 states. [2019-12-07 10:20:08,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:08,303 INFO L93 Difference]: Finished difference Result 29375 states and 85666 transitions. [2019-12-07 10:20:08,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:20:08,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 10:20:08,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:08,334 INFO L225 Difference]: With dead ends: 29375 [2019-12-07 10:20:08,334 INFO L226 Difference]: Without dead ends: 29375 [2019-12-07 10:20:08,335 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 10:20:08,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29375 states. [2019-12-07 10:20:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29375 to 25210. [2019-12-07 10:20:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25210 states. [2019-12-07 10:20:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25210 states to 25210 states and 74274 transitions. [2019-12-07 10:20:08,709 INFO L78 Accepts]: Start accepts. Automaton has 25210 states and 74274 transitions. Word has length 41 [2019-12-07 10:20:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:08,710 INFO L462 AbstractCegarLoop]: Abstraction has 25210 states and 74274 transitions. [2019-12-07 10:20:08,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:20:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 25210 states and 74274 transitions. [2019-12-07 10:20:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:20:08,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:08,731 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:08,731 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:08,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:08,731 INFO L82 PathProgramCache]: Analyzing trace with hash 884175412, now seen corresponding path program 1 times [2019-12-07 10:20:08,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:08,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115084042] [2019-12-07 10:20:08,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:08,764 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 10:20:08,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115084042] [2019-12-07 10:20:08,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:08,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:20:08,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800593652] [2019-12-07 10:20:08,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:20:08,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:08,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:20:08,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:20:08,765 INFO L87 Difference]: Start difference. First operand 25210 states and 74274 transitions. Second operand 5 states. [2019-12-07 10:20:08,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:08,829 INFO L93 Difference]: Finished difference Result 23547 states and 70664 transitions. [2019-12-07 10:20:08,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:20:08,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 10:20:08,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:08,853 INFO L225 Difference]: With dead ends: 23547 [2019-12-07 10:20:08,853 INFO L226 Difference]: Without dead ends: 21768 [2019-12-07 10:20:08,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:20:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21768 states. [2019-12-07 10:20:09,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21768 to 14087. [2019-12-07 10:20:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14087 states. [2019-12-07 10:20:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14087 states to 14087 states and 42800 transitions. [2019-12-07 10:20:09,100 INFO L78 Accepts]: Start accepts. Automaton has 14087 states and 42800 transitions. Word has length 42 [2019-12-07 10:20:09,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:09,100 INFO L462 AbstractCegarLoop]: Abstraction has 14087 states and 42800 transitions. [2019-12-07 10:20:09,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:20:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 14087 states and 42800 transitions. [2019-12-07 10:20:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:20:09,113 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:09,113 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:09,113 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:09,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:09,113 INFO L82 PathProgramCache]: Analyzing trace with hash 168578630, now seen corresponding path program 1 times [2019-12-07 10:20:09,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:09,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633495590] [2019-12-07 10:20:09,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:09,178 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 10:20:09,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633495590] [2019-12-07 10:20:09,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:09,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:20:09,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167791413] [2019-12-07 10:20:09,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:20:09,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:09,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:20:09,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:20:09,179 INFO L87 Difference]: Start difference. First operand 14087 states and 42800 transitions. Second operand 7 states. [2019-12-07 10:20:10,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:10,046 INFO L93 Difference]: Finished difference Result 28240 states and 84187 transitions. [2019-12-07 10:20:10,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 10:20:10,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 10:20:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:10,076 INFO L225 Difference]: With dead ends: 28240 [2019-12-07 10:20:10,076 INFO L226 Difference]: Without dead ends: 28240 [2019-12-07 10:20:10,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:20:10,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28240 states. [2019-12-07 10:20:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28240 to 14583. [2019-12-07 10:20:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14583 states. [2019-12-07 10:20:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14583 states to 14583 states and 44358 transitions. [2019-12-07 10:20:10,381 INFO L78 Accepts]: Start accepts. Automaton has 14583 states and 44358 transitions. Word has length 66 [2019-12-07 10:20:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:10,381 INFO L462 AbstractCegarLoop]: Abstraction has 14583 states and 44358 transitions. [2019-12-07 10:20:10,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:20:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 14583 states and 44358 transitions. [2019-12-07 10:20:10,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:20:10,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:10,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:10,395 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:10,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:10,395 INFO L82 PathProgramCache]: Analyzing trace with hash 712249250, now seen corresponding path program 2 times [2019-12-07 10:20:10,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:10,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155937753] [2019-12-07 10:20:10,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:10,465 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 10:20:10,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155937753] [2019-12-07 10:20:10,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:10,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:20:10,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809604827] [2019-12-07 10:20:10,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:20:10,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:10,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:20:10,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:20:10,466 INFO L87 Difference]: Start difference. First operand 14583 states and 44358 transitions. Second operand 8 states. [2019-12-07 10:20:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:11,732 INFO L93 Difference]: Finished difference Result 30712 states and 91086 transitions. [2019-12-07 10:20:11,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 10:20:11,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-07 10:20:11,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:11,761 INFO L225 Difference]: With dead ends: 30712 [2019-12-07 10:20:11,761 INFO L226 Difference]: Without dead ends: 30712 [2019-12-07 10:20:11,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2019-12-07 10:20:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30712 states. [2019-12-07 10:20:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30712 to 14546. [2019-12-07 10:20:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14546 states. [2019-12-07 10:20:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14546 states to 14546 states and 44228 transitions. [2019-12-07 10:20:12,071 INFO L78 Accepts]: Start accepts. Automaton has 14546 states and 44228 transitions. Word has length 66 [2019-12-07 10:20:12,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:12,071 INFO L462 AbstractCegarLoop]: Abstraction has 14546 states and 44228 transitions. [2019-12-07 10:20:12,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:20:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 14546 states and 44228 transitions. [2019-12-07 10:20:12,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:20:12,084 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:12,084 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:12,084 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:12,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:12,084 INFO L82 PathProgramCache]: Analyzing trace with hash 257156348, now seen corresponding path program 3 times [2019-12-07 10:20:12,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:12,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778201543] [2019-12-07 10:20:12,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:12,167 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 10:20:12,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778201543] [2019-12-07 10:20:12,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:12,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:20:12,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957455622] [2019-12-07 10:20:12,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:20:12,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:12,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:20:12,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:20:12,168 INFO L87 Difference]: Start difference. First operand 14546 states and 44228 transitions. Second operand 9 states. [2019-12-07 10:20:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:13,732 INFO L93 Difference]: Finished difference Result 34431 states and 101478 transitions. [2019-12-07 10:20:13,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 10:20:13,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-07 10:20:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:13,768 INFO L225 Difference]: With dead ends: 34431 [2019-12-07 10:20:13,768 INFO L226 Difference]: Without dead ends: 34431 [2019-12-07 10:20:13,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=1277, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 10:20:13,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34431 states. [2019-12-07 10:20:14,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34431 to 14307. [2019-12-07 10:20:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14307 states. [2019-12-07 10:20:14,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14307 states to 14307 states and 43471 transitions. [2019-12-07 10:20:14,113 INFO L78 Accepts]: Start accepts. Automaton has 14307 states and 43471 transitions. Word has length 66 [2019-12-07 10:20:14,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:14,114 INFO L462 AbstractCegarLoop]: Abstraction has 14307 states and 43471 transitions. [2019-12-07 10:20:14,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:20:14,114 INFO L276 IsEmpty]: Start isEmpty. Operand 14307 states and 43471 transitions. [2019-12-07 10:20:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:20:14,127 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:14,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:14,127 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:14,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:14,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1254491896, now seen corresponding path program 4 times [2019-12-07 10:20:14,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:14,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365459907] [2019-12-07 10:20:14,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:14,198 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 10:20:14,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365459907] [2019-12-07 10:20:14,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:14,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:20:14,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354451386] [2019-12-07 10:20:14,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:20:14,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:14,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:20:14,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:20:14,200 INFO L87 Difference]: Start difference. First operand 14307 states and 43471 transitions. Second operand 7 states. [2019-12-07 10:20:14,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:14,614 INFO L93 Difference]: Finished difference Result 58294 states and 175227 transitions. [2019-12-07 10:20:14,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:20:14,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 10:20:14,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:14,660 INFO L225 Difference]: With dead ends: 58294 [2019-12-07 10:20:14,660 INFO L226 Difference]: Without dead ends: 40898 [2019-12-07 10:20:14,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:20:14,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40898 states. [2019-12-07 10:20:15,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40898 to 16890. [2019-12-07 10:20:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16890 states. [2019-12-07 10:20:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16890 states to 16890 states and 50849 transitions. [2019-12-07 10:20:15,042 INFO L78 Accepts]: Start accepts. Automaton has 16890 states and 50849 transitions. Word has length 66 [2019-12-07 10:20:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:15,042 INFO L462 AbstractCegarLoop]: Abstraction has 16890 states and 50849 transitions. [2019-12-07 10:20:15,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:20:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 16890 states and 50849 transitions. [2019-12-07 10:20:15,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:20:15,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:15,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:15,057 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:15,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:15,057 INFO L82 PathProgramCache]: Analyzing trace with hash 508796180, now seen corresponding path program 5 times [2019-12-07 10:20:15,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:15,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679234077] [2019-12-07 10:20:15,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:15,113 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 10:20:15,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679234077] [2019-12-07 10:20:15,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:15,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:20:15,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725122557] [2019-12-07 10:20:15,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:20:15,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:15,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:20:15,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:20:15,115 INFO L87 Difference]: Start difference. First operand 16890 states and 50849 transitions. Second operand 4 states. [2019-12-07 10:20:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:15,185 INFO L93 Difference]: Finished difference Result 30157 states and 90981 transitions. [2019-12-07 10:20:15,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:20:15,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 10:20:15,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:15,200 INFO L225 Difference]: With dead ends: 30157 [2019-12-07 10:20:15,200 INFO L226 Difference]: Without dead ends: 13325 [2019-12-07 10:20:15,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:20:15,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13325 states. [2019-12-07 10:20:15,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13325 to 13325. [2019-12-07 10:20:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13325 states. [2019-12-07 10:20:15,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13325 states to 13325 states and 40039 transitions. [2019-12-07 10:20:15,383 INFO L78 Accepts]: Start accepts. Automaton has 13325 states and 40039 transitions. Word has length 66 [2019-12-07 10:20:15,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:15,384 INFO L462 AbstractCegarLoop]: Abstraction has 13325 states and 40039 transitions. [2019-12-07 10:20:15,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:20:15,384 INFO L276 IsEmpty]: Start isEmpty. Operand 13325 states and 40039 transitions. [2019-12-07 10:20:15,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:20:15,395 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:15,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:15,395 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:15,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:15,396 INFO L82 PathProgramCache]: Analyzing trace with hash -178270044, now seen corresponding path program 6 times [2019-12-07 10:20:15,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:15,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146864949] [2019-12-07 10:20:15,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:15,446 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 10:20:15,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146864949] [2019-12-07 10:20:15,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:15,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:20:15,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030265936] [2019-12-07 10:20:15,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:20:15,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:15,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:20:15,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:20:15,447 INFO L87 Difference]: Start difference. First operand 13325 states and 40039 transitions. Second operand 4 states. [2019-12-07 10:20:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:15,510 INFO L93 Difference]: Finished difference Result 15005 states and 44913 transitions. [2019-12-07 10:20:15,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:20:15,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 10:20:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:15,526 INFO L225 Difference]: With dead ends: 15005 [2019-12-07 10:20:15,526 INFO L226 Difference]: Without dead ends: 15005 [2019-12-07 10:20:15,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:20:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15005 states. [2019-12-07 10:20:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15005 to 12587. [2019-12-07 10:20:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12587 states. [2019-12-07 10:20:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12587 states to 12587 states and 37808 transitions. [2019-12-07 10:20:15,725 INFO L78 Accepts]: Start accepts. Automaton has 12587 states and 37808 transitions. Word has length 66 [2019-12-07 10:20:15,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:15,725 INFO L462 AbstractCegarLoop]: Abstraction has 12587 states and 37808 transitions. [2019-12-07 10:20:15,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:20:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 12587 states and 37808 transitions. [2019-12-07 10:20:15,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:20:15,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:15,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:15,737 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:15,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:15,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2050480149, now seen corresponding path program 1 times [2019-12-07 10:20:15,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:15,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267138234] [2019-12-07 10:20:15,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:15,931 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 10:20:15,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267138234] [2019-12-07 10:20:15,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:15,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:20:15,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083243514] [2019-12-07 10:20:15,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:20:15,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:15,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:20:15,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:20:15,932 INFO L87 Difference]: Start difference. First operand 12587 states and 37808 transitions. Second operand 11 states. [2019-12-07 10:20:16,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:16,968 INFO L93 Difference]: Finished difference Result 24963 states and 73217 transitions. [2019-12-07 10:20:16,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 10:20:16,968 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 10:20:16,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:16,984 INFO L225 Difference]: With dead ends: 24963 [2019-12-07 10:20:16,985 INFO L226 Difference]: Without dead ends: 17033 [2019-12-07 10:20:16,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2019-12-07 10:20:17,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17033 states. [2019-12-07 10:20:17,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17033 to 13318. [2019-12-07 10:20:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13318 states. [2019-12-07 10:20:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13318 states to 13318 states and 39484 transitions. [2019-12-07 10:20:17,190 INFO L78 Accepts]: Start accepts. Automaton has 13318 states and 39484 transitions. Word has length 67 [2019-12-07 10:20:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:17,190 INFO L462 AbstractCegarLoop]: Abstraction has 13318 states and 39484 transitions. [2019-12-07 10:20:17,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:20:17,190 INFO L276 IsEmpty]: Start isEmpty. Operand 13318 states and 39484 transitions. [2019-12-07 10:20:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:20:17,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:17,202 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:17,202 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:17,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:17,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1111193301, now seen corresponding path program 2 times [2019-12-07 10:20:17,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:17,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212525402] [2019-12-07 10:20:17,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:17,570 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 10:20:17,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212525402] [2019-12-07 10:20:17,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:17,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 10:20:17,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463291979] [2019-12-07 10:20:17,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 10:20:17,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:17,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:20:17,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:20:17,571 INFO L87 Difference]: Start difference. First operand 13318 states and 39484 transitions. Second operand 15 states. [2019-12-07 10:20:21,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:21,023 INFO L93 Difference]: Finished difference Result 18403 states and 53513 transitions. [2019-12-07 10:20:21,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-07 10:20:21,024 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-07 10:20:21,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:21,039 INFO L225 Difference]: With dead ends: 18403 [2019-12-07 10:20:21,039 INFO L226 Difference]: Without dead ends: 15654 [2019-12-07 10:20:21,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=679, Invalid=3611, Unknown=0, NotChecked=0, Total=4290 [2019-12-07 10:20:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15654 states. [2019-12-07 10:20:21,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15654 to 13498. [2019-12-07 10:20:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13498 states. [2019-12-07 10:20:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13498 states to 13498 states and 39923 transitions. [2019-12-07 10:20:21,243 INFO L78 Accepts]: Start accepts. Automaton has 13498 states and 39923 transitions. Word has length 67 [2019-12-07 10:20:21,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:21,243 INFO L462 AbstractCegarLoop]: Abstraction has 13498 states and 39923 transitions. [2019-12-07 10:20:21,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 10:20:21,243 INFO L276 IsEmpty]: Start isEmpty. Operand 13498 states and 39923 transitions. [2019-12-07 10:20:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:20:21,256 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:21,256 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:21,256 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:21,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:21,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2057057855, now seen corresponding path program 3 times [2019-12-07 10:20:21,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:21,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461561848] [2019-12-07 10:20:21,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:21,417 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 10:20:21,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461561848] [2019-12-07 10:20:21,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:21,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:20:21,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275322260] [2019-12-07 10:20:21,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:20:21,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:21,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:20:21,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:20:21,418 INFO L87 Difference]: Start difference. First operand 13498 states and 39923 transitions. Second operand 12 states. [2019-12-07 10:20:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:22,527 INFO L93 Difference]: Finished difference Result 24173 states and 70322 transitions. [2019-12-07 10:20:22,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 10:20:22,527 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 10:20:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:22,543 INFO L225 Difference]: With dead ends: 24173 [2019-12-07 10:20:22,543 INFO L226 Difference]: Without dead ends: 16420 [2019-12-07 10:20:22,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2019-12-07 10:20:22,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16420 states. [2019-12-07 10:20:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16420 to 13022. [2019-12-07 10:20:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13022 states. [2019-12-07 10:20:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13022 states to 13022 states and 38532 transitions. [2019-12-07 10:20:22,744 INFO L78 Accepts]: Start accepts. Automaton has 13022 states and 38532 transitions. Word has length 67 [2019-12-07 10:20:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:22,744 INFO L462 AbstractCegarLoop]: Abstraction has 13022 states and 38532 transitions. [2019-12-07 10:20:22,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:20:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 13022 states and 38532 transitions. [2019-12-07 10:20:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:20:22,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:22,756 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:22,756 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:22,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:22,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1347841601, now seen corresponding path program 4 times [2019-12-07 10:20:22,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:22,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092171297] [2019-12-07 10:20:22,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:23,067 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 10:20:23,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092171297] [2019-12-07 10:20:23,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:23,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 10:20:23,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946222872] [2019-12-07 10:20:23,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 10:20:23,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:23,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:20:23,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:20:23,068 INFO L87 Difference]: Start difference. First operand 13022 states and 38532 transitions. Second operand 15 states. [2019-12-07 10:20:24,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:24,101 INFO L93 Difference]: Finished difference Result 16240 states and 47232 transitions. [2019-12-07 10:20:24,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 10:20:24,101 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-07 10:20:24,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:24,116 INFO L225 Difference]: With dead ends: 16240 [2019-12-07 10:20:24,116 INFO L226 Difference]: Without dead ends: 14873 [2019-12-07 10:20:24,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2019-12-07 10:20:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14873 states. [2019-12-07 10:20:24,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14873 to 13082. [2019-12-07 10:20:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13082 states. [2019-12-07 10:20:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13082 states to 13082 states and 38680 transitions. [2019-12-07 10:20:24,306 INFO L78 Accepts]: Start accepts. Automaton has 13082 states and 38680 transitions. Word has length 67 [2019-12-07 10:20:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:24,306 INFO L462 AbstractCegarLoop]: Abstraction has 13082 states and 38680 transitions. [2019-12-07 10:20:24,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 10:20:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 13082 states and 38680 transitions. [2019-12-07 10:20:24,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:20:24,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:24,318 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:24,318 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:24,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:24,318 INFO L82 PathProgramCache]: Analyzing trace with hash 244629709, now seen corresponding path program 5 times [2019-12-07 10:20:24,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:24,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489498490] [2019-12-07 10:20:24,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:24,488 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 10:20:24,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489498490] [2019-12-07 10:20:24,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:24,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:20:24,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374242641] [2019-12-07 10:20:24,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:20:24,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:20:24,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:20:24,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:20:24,489 INFO L87 Difference]: Start difference. First operand 13082 states and 38680 transitions. Second operand 11 states. [2019-12-07 10:20:25,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:25,048 INFO L93 Difference]: Finished difference Result 19178 states and 56135 transitions. [2019-12-07 10:20:25,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 10:20:25,048 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 10:20:25,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:25,064 INFO L225 Difference]: With dead ends: 19178 [2019-12-07 10:20:25,065 INFO L226 Difference]: Without dead ends: 15808 [2019-12-07 10:20:25,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2019-12-07 10:20:25,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15808 states. [2019-12-07 10:20:25,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15808 to 12222. [2019-12-07 10:20:25,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12222 states. [2019-12-07 10:20:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12222 states to 12222 states and 36441 transitions. [2019-12-07 10:20:25,252 INFO L78 Accepts]: Start accepts. Automaton has 12222 states and 36441 transitions. Word has length 67 [2019-12-07 10:20:25,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:25,252 INFO L462 AbstractCegarLoop]: Abstraction has 12222 states and 36441 transitions. [2019-12-07 10:20:25,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:20:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 12222 states and 36441 transitions. [2019-12-07 10:20:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:20:25,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:25,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:25,261 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:25,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:25,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1127178005, now seen corresponding path program 6 times [2019-12-07 10:20:25,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:20:25,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336821716] [2019-12-07 10:20:25,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:20:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:20:25,345 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 10:20:25,345 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:20:25,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= 0 v_~z$r_buff1_thd3~0_333) (= 0 v_~__unbuffered_cnt~0_79) (= v_~z~0_222 0) (= 0 v_~x~0_150) (= 0 v_~z$flush_delayed~0_66) (= v_~__unbuffered_p2_EBX~0_70 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t745~0.base_43|) (= (store .cse0 |v_ULTIMATE.start_main_~#t745~0.base_43| 1) |v_#valid_80|) (= v_~y~0_71 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$r_buff0_thd1~0_186 0) (= v_~z$w_buff1_used~0_670 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t745~0.base_43| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t745~0.base_43|) |v_ULTIMATE.start_main_~#t745~0.offset_29| 0)) |v_#memory_int_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t745~0.base_43|) 0) (= v_~z$r_buff0_thd2~0_110 0) (= 0 v_~weak$$choice0~0_29) (= v_~z$w_buff0~0_701 0) (= v_~z$r_buff1_thd0~0_201 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff0_thd3~0_363) (= 0 v_~__unbuffered_p2_EAX~0_62) (= |v_#NULL.offset_5| 0) (= v_~z$mem_tmp~0_43 0) (= v_~z$r_buff0_thd0~0_137 0) (= v_~weak$$choice2~0_160 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t745~0.base_43| 4)) (= 0 |v_ULTIMATE.start_main_~#t745~0.offset_29|) (= v_~z$r_buff1_thd1~0_144 0) (= v_~z$r_buff1_thd2~0_165 0) (= v_~z$w_buff0_used~0_1072 0) (= v_~z$w_buff1~0_410 0) (= v_~main$tmp_guard0~0_24 0) (= v_~main$tmp_guard1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_46|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_202|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_120|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start_main_~#t745~0.base=|v_ULTIMATE.start_main_~#t745~0.base_43|, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~z$mem_tmp~0=v_~z$mem_tmp~0_43, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_~#t747~0.base=|v_ULTIMATE.start_main_~#t747~0.base_29|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_670, ULTIMATE.start_main_~#t746~0.offset=|v_ULTIMATE.start_main_~#t746~0.offset_22|, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_144, ULTIMATE.start_main_~#t747~0.offset=|v_ULTIMATE.start_main_~#t747~0.offset_21|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_363, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~x~0=v_~x~0_150, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_410, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_74|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t746~0.base=|v_ULTIMATE.start_main_~#t746~0.base_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_34|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_201, ~y~0=v_~y~0_71, ULTIMATE.start_main_~#t745~0.offset=|v_ULTIMATE.start_main_~#t745~0.offset_29|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_110, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_26|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1072, ~z$w_buff0~0=v_~z$w_buff0~0_701, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_333, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_80|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_222, ~weak$$choice2~0=v_~weak$$choice2~0_160, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_186} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t746~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t745~0.base, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t745~0.offset, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t747~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t746~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, ULTIMATE.start_main_~#t747~0.offset, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 10:20:25,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L823-1-->L825: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t746~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t746~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t746~0.base_11|) |v_ULTIMATE.start_main_~#t746~0.offset_10| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t746~0.offset_10| 0) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t746~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t746~0.base_11| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t746~0.base_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t746~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t746~0.offset=|v_ULTIMATE.start_main_~#t746~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t746~0.base=|v_ULTIMATE.start_main_~#t746~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t746~0.offset, #length, ULTIMATE.start_main_~#t746~0.base] because there is no mapped edge [2019-12-07 10:20:25,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_21 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_19| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_174 256) 0)) (not (= (mod v_~z$w_buff1_used~0_104 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_174 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_21 0)) (= v_~z$w_buff0~0_53 v_~z$w_buff1~0_38) (= v_~z$w_buff0_used~0_175 v_~z$w_buff1_used~0_104) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= 1 v_~z$w_buff0~0_52)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~z$w_buff0~0=v_~z$w_buff0~0_53, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_174, ~z$w_buff0~0=v_~z$w_buff0~0_52, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~z$w_buff1~0=v_~z$w_buff1~0_38, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 10:20:25,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L825-1-->L827: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t747~0.base_10| 4) |v_#length_15|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t747~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t747~0.base_10|) |v_ULTIMATE.start_main_~#t747~0.offset_9| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t747~0.base_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t747~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t747~0.base_10| 0)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t747~0.base_10|) 0) (= 0 |v_ULTIMATE.start_main_~#t747~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t747~0.base=|v_ULTIMATE.start_main_~#t747~0.base_10|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t747~0.offset=|v_ULTIMATE.start_main_~#t747~0.offset_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t747~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t747~0.offset, #length] because there is no mapped edge [2019-12-07 10:20:25,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L764-2-->L764-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In2061772868 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In2061772868 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out2061772868| ~z$w_buff1~0_In2061772868) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out2061772868| ~z~0_In2061772868)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2061772868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2061772868, ~z$w_buff1~0=~z$w_buff1~0_In2061772868, ~z~0=~z~0_In2061772868} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out2061772868|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2061772868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2061772868, ~z$w_buff1~0=~z$w_buff1~0_In2061772868, ~z~0=~z~0_In2061772868} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 10:20:25,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In170321841 256) 0))) (or (and (= ~z$w_buff0~0_In170321841 |P2Thread1of1ForFork2_#t~ite21_Out170321841|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite20_In170321841| |P2Thread1of1ForFork2_#t~ite20_Out170321841|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In170321841 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In170321841 256))) (= (mod ~z$w_buff0_used~0_In170321841 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In170321841 256))))) (= ~z$w_buff0~0_In170321841 |P2Thread1of1ForFork2_#t~ite20_Out170321841|) (= |P2Thread1of1ForFork2_#t~ite21_Out170321841| |P2Thread1of1ForFork2_#t~ite20_Out170321841|) .cse0))) InVars {~z$w_buff0~0=~z$w_buff0~0_In170321841, ~z$w_buff0_used~0=~z$w_buff0_used~0_In170321841, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In170321841|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In170321841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In170321841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In170321841, ~weak$$choice2~0=~weak$$choice2~0_In170321841} OutVars{~z$w_buff0~0=~z$w_buff0~0_In170321841, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out170321841|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In170321841, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out170321841|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In170321841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In170321841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In170321841, ~weak$$choice2~0=~weak$$choice2~0_In170321841} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 10:20:25,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-771211460 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-771211460 256) 0))) (or (and (= ~z$w_buff0_used~0_In-771211460 |P0Thread1of1ForFork0_#t~ite5_Out-771211460|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-771211460|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-771211460, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-771211460} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-771211460|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-771211460, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-771211460} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 10:20:25,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In524736670 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In524736670 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In524736670 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In524736670 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out524736670| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out524736670| ~z$w_buff1_used~0_In524736670)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In524736670, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In524736670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In524736670, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In524736670} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out524736670|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In524736670, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In524736670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In524736670, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In524736670} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 10:20:25,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In210317701 256))) (.cse0 (= ~z$r_buff0_thd1~0_In210317701 ~z$r_buff0_thd1~0_Out210317701)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In210317701 256)))) (or (and .cse0 .cse1) (and (= 0 ~z$r_buff0_thd1~0_Out210317701) (not .cse2) (not .cse1)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In210317701, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In210317701} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In210317701, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out210317701|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out210317701} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:20:25,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2051459717 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-2051459717 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2051459717 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-2051459717 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-2051459717| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-2051459717| ~z$r_buff1_thd1~0_In-2051459717) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2051459717, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2051459717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2051459717, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2051459717} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2051459717, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2051459717|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2051459717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2051459717, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2051459717} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 10:20:25,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L748-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~z$r_buff1_thd1~0_62 |v_P0Thread1of1ForFork0_#t~ite8_22|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_62, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 10:20:25,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L790-->L790-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In26434703 256) 0))) (or (and (= ~z$w_buff1~0_In26434703 |P2Thread1of1ForFork2_#t~ite23_Out26434703|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In26434703 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In26434703 256)) .cse0) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In26434703 256))) (= (mod ~z$w_buff0_used~0_In26434703 256) 0))) .cse1 (= |P2Thread1of1ForFork2_#t~ite24_Out26434703| |P2Thread1of1ForFork2_#t~ite23_Out26434703|)) (and (= ~z$w_buff1~0_In26434703 |P2Thread1of1ForFork2_#t~ite24_Out26434703|) (= |P2Thread1of1ForFork2_#t~ite23_In26434703| |P2Thread1of1ForFork2_#t~ite23_Out26434703|) (not .cse1)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In26434703|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In26434703, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In26434703, ~z$w_buff1_used~0=~z$w_buff1_used~0_In26434703, ~z$w_buff1~0=~z$w_buff1~0_In26434703, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In26434703, ~weak$$choice2~0=~weak$$choice2~0_In26434703} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out26434703|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out26434703|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In26434703, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In26434703, ~z$w_buff1_used~0=~z$w_buff1_used~0_In26434703, ~z$w_buff1~0=~z$w_buff1~0_In26434703, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In26434703, ~weak$$choice2~0=~weak$$choice2~0_In26434703} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 10:20:25,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L791-->L791-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In766977074 256)))) (or (and .cse0 (= ~z$w_buff0_used~0_In766977074 |P2Thread1of1ForFork2_#t~ite26_Out766977074|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In766977074 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In766977074 256))) (and (= 0 (mod ~z$w_buff1_used~0_In766977074 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In766977074 256)))) (= |P2Thread1of1ForFork2_#t~ite27_Out766977074| |P2Thread1of1ForFork2_#t~ite26_Out766977074|)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite27_Out766977074| ~z$w_buff0_used~0_In766977074) (= |P2Thread1of1ForFork2_#t~ite26_In766977074| |P2Thread1of1ForFork2_#t~ite26_Out766977074|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In766977074|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In766977074, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In766977074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In766977074, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In766977074, ~weak$$choice2~0=~weak$$choice2~0_In766977074} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out766977074|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In766977074, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In766977074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In766977074, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In766977074, ~weak$$choice2~0=~weak$$choice2~0_In766977074, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out766977074|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 10:20:25,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L793-->L794: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_119 v_~z$r_buff0_thd3~0_118)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_119, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_6|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 10:20:25,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_6| v_~z~0_16) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_6|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_5|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_5|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-07 10:20:25,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1617959878 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1617959878 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1617959878| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1617959878| ~z$w_buff0_used~0_In-1617959878) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1617959878, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1617959878} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1617959878, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1617959878|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1617959878} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 10:20:25,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L766-->L766-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In141598029 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In141598029 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In141598029 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In141598029 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In141598029 |P1Thread1of1ForFork1_#t~ite12_Out141598029|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out141598029|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In141598029, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In141598029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In141598029, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In141598029} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In141598029, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In141598029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In141598029, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out141598029|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In141598029} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 10:20:25,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In506336193 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In506336193 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out506336193|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out506336193| ~z$r_buff0_thd2~0_In506336193) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In506336193, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In506336193} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In506336193, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out506336193|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In506336193} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 10:20:25,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L796-->L800: Formula: (and (= v_~z~0_64 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 10:20:25,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L800-2-->L800-5: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In745139152 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In745139152 256))) (.cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out745139152| |P2Thread1of1ForFork2_#t~ite39_Out745139152|))) (or (and (not .cse0) .cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out745139152| ~z$w_buff1~0_In745139152) (not .cse2)) (and (or .cse2 .cse0) .cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out745139152| ~z~0_In745139152)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In745139152, ~z$w_buff1_used~0=~z$w_buff1_used~0_In745139152, ~z$w_buff1~0=~z$w_buff1~0_In745139152, ~z~0=~z~0_In745139152} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In745139152, ~z$w_buff1_used~0=~z$w_buff1_used~0_In745139152, ~z$w_buff1~0=~z$w_buff1~0_In745139152, ~z~0=~z~0_In745139152, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out745139152|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out745139152|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 10:20:25,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1110084360 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1110084360 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite40_Out-1110084360| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite40_Out-1110084360| ~z$w_buff0_used~0_In-1110084360) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1110084360, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1110084360} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1110084360, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1110084360, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1110084360|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 10:20:25,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L802-->L802-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-1529251070 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1529251070 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1529251070 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1529251070 256)))) (or (and (= ~z$w_buff1_used~0_In-1529251070 |P2Thread1of1ForFork2_#t~ite41_Out-1529251070|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-1529251070|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1529251070, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1529251070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1529251070, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1529251070} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1529251070|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1529251070, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1529251070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1529251070, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1529251070} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 10:20:25,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1327305483 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1327305483 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1327305483 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1327305483 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1327305483|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-1327305483 |P1Thread1of1ForFork1_#t~ite14_Out-1327305483|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1327305483, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1327305483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1327305483, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1327305483} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1327305483, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1327305483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1327305483, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1327305483|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1327305483} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 10:20:25,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L768-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite14_26| v_~z$r_buff1_thd2~0_70) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_26|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_25|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:20:25,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In138805361 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In138805361 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out138805361|) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In138805361 |P2Thread1of1ForFork2_#t~ite42_Out138805361|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In138805361, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In138805361} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out138805361|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In138805361, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In138805361} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 10:20:25,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In332727980 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In332727980 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In332727980 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In332727980 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In332727980 |P2Thread1of1ForFork2_#t~ite43_Out332727980|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite43_Out332727980|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In332727980, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In332727980, ~z$w_buff1_used~0=~z$w_buff1_used~0_In332727980, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In332727980} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In332727980, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In332727980, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out332727980|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In332727980, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In332727980} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 10:20:25,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L804-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= v_~z$r_buff1_thd3~0_119 |v_P2Thread1of1ForFork2_#t~ite43_26|)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_119, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 10:20:25,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L827-1-->L833: Formula: (and (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_34) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_9 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:20:25,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L833-2-->L833-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite48_Out-1358582275| |ULTIMATE.start_main_#t~ite47_Out-1358582275|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1358582275 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1358582275 256) 0))) (or (and (= ~z$w_buff1~0_In-1358582275 |ULTIMATE.start_main_#t~ite47_Out-1358582275|) (not .cse0) .cse1 (not .cse2)) (and (= ~z~0_In-1358582275 |ULTIMATE.start_main_#t~ite47_Out-1358582275|) .cse1 (or .cse0 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1358582275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1358582275, ~z$w_buff1~0=~z$w_buff1~0_In-1358582275, ~z~0=~z~0_In-1358582275} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1358582275, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1358582275|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1358582275, ~z$w_buff1~0=~z$w_buff1~0_In-1358582275, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1358582275|, ~z~0=~z~0_In-1358582275} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 10:20:25,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In185604816 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In185604816 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In185604816 |ULTIMATE.start_main_#t~ite49_Out185604816|)) (and (= |ULTIMATE.start_main_#t~ite49_Out185604816| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In185604816, ~z$w_buff0_used~0=~z$w_buff0_used~0_In185604816} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In185604816, ~z$w_buff0_used~0=~z$w_buff0_used~0_In185604816, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out185604816|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 10:20:25,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L835-->L835-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-540213841 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-540213841 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-540213841 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-540213841 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-540213841 |ULTIMATE.start_main_#t~ite50_Out-540213841|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-540213841|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-540213841, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-540213841, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-540213841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-540213841} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-540213841|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-540213841, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-540213841, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-540213841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-540213841} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 10:20:25,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In486572563 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In486572563 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In486572563 |ULTIMATE.start_main_#t~ite51_Out486572563|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out486572563|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In486572563, ~z$w_buff0_used~0=~z$w_buff0_used~0_In486572563} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In486572563, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out486572563|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In486572563} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 10:20:25,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L837-->L837-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2116334430 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-2116334430 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2116334430 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2116334430 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-2116334430 |ULTIMATE.start_main_#t~ite52_Out-2116334430|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-2116334430|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2116334430, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2116334430, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2116334430, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2116334430} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2116334430|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2116334430, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2116334430, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2116334430, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2116334430} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 10:20:25,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_27 (ite (= 0 (ite (not (and (= v_~y~0_37 2) (= 2 v_~__unbuffered_p2_EAX~0_30) (= v_~__unbuffered_p2_EBX~0_37 0) (= 2 v_~x~0_117))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= (mod v_~main$tmp_guard1~0_27 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_162 |v_ULTIMATE.start_main_#t~ite52_69|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_69|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~y~0=v_~y~0_37, ~x~0=v_~x~0_117} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_162, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~y~0=v_~y~0_37, ~x~0=v_~x~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:20:25,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:20:25 BasicIcfg [2019-12-07 10:20:25,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:20:25,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:20:25,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:20:25,412 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:20:25,412 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:18:55" (3/4) ... [2019-12-07 10:20:25,414 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:20:25,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= 0 v_~z$r_buff1_thd3~0_333) (= 0 v_~__unbuffered_cnt~0_79) (= v_~z~0_222 0) (= 0 v_~x~0_150) (= 0 v_~z$flush_delayed~0_66) (= v_~__unbuffered_p2_EBX~0_70 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t745~0.base_43|) (= (store .cse0 |v_ULTIMATE.start_main_~#t745~0.base_43| 1) |v_#valid_80|) (= v_~y~0_71 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$r_buff0_thd1~0_186 0) (= v_~z$w_buff1_used~0_670 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t745~0.base_43| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t745~0.base_43|) |v_ULTIMATE.start_main_~#t745~0.offset_29| 0)) |v_#memory_int_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t745~0.base_43|) 0) (= v_~z$r_buff0_thd2~0_110 0) (= 0 v_~weak$$choice0~0_29) (= v_~z$w_buff0~0_701 0) (= v_~z$r_buff1_thd0~0_201 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff0_thd3~0_363) (= 0 v_~__unbuffered_p2_EAX~0_62) (= |v_#NULL.offset_5| 0) (= v_~z$mem_tmp~0_43 0) (= v_~z$r_buff0_thd0~0_137 0) (= v_~weak$$choice2~0_160 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t745~0.base_43| 4)) (= 0 |v_ULTIMATE.start_main_~#t745~0.offset_29|) (= v_~z$r_buff1_thd1~0_144 0) (= v_~z$r_buff1_thd2~0_165 0) (= v_~z$w_buff0_used~0_1072 0) (= v_~z$w_buff1~0_410 0) (= v_~main$tmp_guard0~0_24 0) (= v_~main$tmp_guard1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_46|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_202|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_120|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start_main_~#t745~0.base=|v_ULTIMATE.start_main_~#t745~0.base_43|, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~z$mem_tmp~0=v_~z$mem_tmp~0_43, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_~#t747~0.base=|v_ULTIMATE.start_main_~#t747~0.base_29|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_670, ULTIMATE.start_main_~#t746~0.offset=|v_ULTIMATE.start_main_~#t746~0.offset_22|, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_144, ULTIMATE.start_main_~#t747~0.offset=|v_ULTIMATE.start_main_~#t747~0.offset_21|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_363, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~x~0=v_~x~0_150, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_410, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_74|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t746~0.base=|v_ULTIMATE.start_main_~#t746~0.base_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_34|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_201, ~y~0=v_~y~0_71, ULTIMATE.start_main_~#t745~0.offset=|v_ULTIMATE.start_main_~#t745~0.offset_29|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_110, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_26|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1072, ~z$w_buff0~0=v_~z$w_buff0~0_701, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_333, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_80|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_222, ~weak$$choice2~0=v_~weak$$choice2~0_160, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_186} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t746~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t745~0.base, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t745~0.offset, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t747~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t746~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, ULTIMATE.start_main_~#t747~0.offset, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 10:20:25,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L823-1-->L825: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t746~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t746~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t746~0.base_11|) |v_ULTIMATE.start_main_~#t746~0.offset_10| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t746~0.offset_10| 0) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t746~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t746~0.base_11| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t746~0.base_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t746~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t746~0.offset=|v_ULTIMATE.start_main_~#t746~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t746~0.base=|v_ULTIMATE.start_main_~#t746~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t746~0.offset, #length, ULTIMATE.start_main_~#t746~0.base] because there is no mapped edge [2019-12-07 10:20:25,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_21 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_19| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_174 256) 0)) (not (= (mod v_~z$w_buff1_used~0_104 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_174 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_21 0)) (= v_~z$w_buff0~0_53 v_~z$w_buff1~0_38) (= v_~z$w_buff0_used~0_175 v_~z$w_buff1_used~0_104) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= 1 v_~z$w_buff0~0_52)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~z$w_buff0~0=v_~z$w_buff0~0_53, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_174, ~z$w_buff0~0=v_~z$w_buff0~0_52, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~z$w_buff1~0=v_~z$w_buff1~0_38, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 10:20:25,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L825-1-->L827: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t747~0.base_10| 4) |v_#length_15|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t747~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t747~0.base_10|) |v_ULTIMATE.start_main_~#t747~0.offset_9| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t747~0.base_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t747~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t747~0.base_10| 0)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t747~0.base_10|) 0) (= 0 |v_ULTIMATE.start_main_~#t747~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t747~0.base=|v_ULTIMATE.start_main_~#t747~0.base_10|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t747~0.offset=|v_ULTIMATE.start_main_~#t747~0.offset_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t747~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t747~0.offset, #length] because there is no mapped edge [2019-12-07 10:20:25,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L764-2-->L764-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In2061772868 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In2061772868 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out2061772868| ~z$w_buff1~0_In2061772868) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out2061772868| ~z~0_In2061772868)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2061772868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2061772868, ~z$w_buff1~0=~z$w_buff1~0_In2061772868, ~z~0=~z~0_In2061772868} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out2061772868|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2061772868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2061772868, ~z$w_buff1~0=~z$w_buff1~0_In2061772868, ~z~0=~z~0_In2061772868} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 10:20:25,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In170321841 256) 0))) (or (and (= ~z$w_buff0~0_In170321841 |P2Thread1of1ForFork2_#t~ite21_Out170321841|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite20_In170321841| |P2Thread1of1ForFork2_#t~ite20_Out170321841|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In170321841 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In170321841 256))) (= (mod ~z$w_buff0_used~0_In170321841 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In170321841 256))))) (= ~z$w_buff0~0_In170321841 |P2Thread1of1ForFork2_#t~ite20_Out170321841|) (= |P2Thread1of1ForFork2_#t~ite21_Out170321841| |P2Thread1of1ForFork2_#t~ite20_Out170321841|) .cse0))) InVars {~z$w_buff0~0=~z$w_buff0~0_In170321841, ~z$w_buff0_used~0=~z$w_buff0_used~0_In170321841, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In170321841|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In170321841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In170321841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In170321841, ~weak$$choice2~0=~weak$$choice2~0_In170321841} OutVars{~z$w_buff0~0=~z$w_buff0~0_In170321841, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out170321841|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In170321841, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out170321841|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In170321841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In170321841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In170321841, ~weak$$choice2~0=~weak$$choice2~0_In170321841} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 10:20:25,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-771211460 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-771211460 256) 0))) (or (and (= ~z$w_buff0_used~0_In-771211460 |P0Thread1of1ForFork0_#t~ite5_Out-771211460|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-771211460|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-771211460, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-771211460} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-771211460|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-771211460, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-771211460} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 10:20:25,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In524736670 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In524736670 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In524736670 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In524736670 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out524736670| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out524736670| ~z$w_buff1_used~0_In524736670)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In524736670, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In524736670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In524736670, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In524736670} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out524736670|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In524736670, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In524736670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In524736670, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In524736670} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 10:20:25,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In210317701 256))) (.cse0 (= ~z$r_buff0_thd1~0_In210317701 ~z$r_buff0_thd1~0_Out210317701)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In210317701 256)))) (or (and .cse0 .cse1) (and (= 0 ~z$r_buff0_thd1~0_Out210317701) (not .cse2) (not .cse1)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In210317701, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In210317701} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In210317701, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out210317701|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out210317701} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:20:25,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2051459717 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-2051459717 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2051459717 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-2051459717 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-2051459717| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-2051459717| ~z$r_buff1_thd1~0_In-2051459717) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2051459717, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2051459717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2051459717, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2051459717} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2051459717, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2051459717|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2051459717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2051459717, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2051459717} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 10:20:25,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L748-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~z$r_buff1_thd1~0_62 |v_P0Thread1of1ForFork0_#t~ite8_22|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_62, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 10:20:25,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L790-->L790-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In26434703 256) 0))) (or (and (= ~z$w_buff1~0_In26434703 |P2Thread1of1ForFork2_#t~ite23_Out26434703|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In26434703 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In26434703 256)) .cse0) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In26434703 256))) (= (mod ~z$w_buff0_used~0_In26434703 256) 0))) .cse1 (= |P2Thread1of1ForFork2_#t~ite24_Out26434703| |P2Thread1of1ForFork2_#t~ite23_Out26434703|)) (and (= ~z$w_buff1~0_In26434703 |P2Thread1of1ForFork2_#t~ite24_Out26434703|) (= |P2Thread1of1ForFork2_#t~ite23_In26434703| |P2Thread1of1ForFork2_#t~ite23_Out26434703|) (not .cse1)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In26434703|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In26434703, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In26434703, ~z$w_buff1_used~0=~z$w_buff1_used~0_In26434703, ~z$w_buff1~0=~z$w_buff1~0_In26434703, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In26434703, ~weak$$choice2~0=~weak$$choice2~0_In26434703} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out26434703|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out26434703|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In26434703, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In26434703, ~z$w_buff1_used~0=~z$w_buff1_used~0_In26434703, ~z$w_buff1~0=~z$w_buff1~0_In26434703, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In26434703, ~weak$$choice2~0=~weak$$choice2~0_In26434703} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 10:20:25,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L791-->L791-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In766977074 256)))) (or (and .cse0 (= ~z$w_buff0_used~0_In766977074 |P2Thread1of1ForFork2_#t~ite26_Out766977074|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In766977074 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In766977074 256))) (and (= 0 (mod ~z$w_buff1_used~0_In766977074 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In766977074 256)))) (= |P2Thread1of1ForFork2_#t~ite27_Out766977074| |P2Thread1of1ForFork2_#t~ite26_Out766977074|)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite27_Out766977074| ~z$w_buff0_used~0_In766977074) (= |P2Thread1of1ForFork2_#t~ite26_In766977074| |P2Thread1of1ForFork2_#t~ite26_Out766977074|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In766977074|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In766977074, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In766977074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In766977074, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In766977074, ~weak$$choice2~0=~weak$$choice2~0_In766977074} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out766977074|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In766977074, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In766977074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In766977074, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In766977074, ~weak$$choice2~0=~weak$$choice2~0_In766977074, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out766977074|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 10:20:25,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L793-->L794: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_119 v_~z$r_buff0_thd3~0_118)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_119, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_6|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 10:20:25,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_6| v_~z~0_16) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_6|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_5|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_5|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-07 10:20:25,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1617959878 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1617959878 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1617959878| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1617959878| ~z$w_buff0_used~0_In-1617959878) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1617959878, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1617959878} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1617959878, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1617959878|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1617959878} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 10:20:25,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L766-->L766-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In141598029 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In141598029 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In141598029 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In141598029 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In141598029 |P1Thread1of1ForFork1_#t~ite12_Out141598029|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out141598029|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In141598029, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In141598029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In141598029, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In141598029} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In141598029, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In141598029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In141598029, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out141598029|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In141598029} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 10:20:25,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In506336193 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In506336193 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out506336193|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out506336193| ~z$r_buff0_thd2~0_In506336193) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In506336193, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In506336193} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In506336193, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out506336193|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In506336193} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 10:20:25,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L796-->L800: Formula: (and (= v_~z~0_64 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 10:20:25,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L800-2-->L800-5: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In745139152 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In745139152 256))) (.cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out745139152| |P2Thread1of1ForFork2_#t~ite39_Out745139152|))) (or (and (not .cse0) .cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out745139152| ~z$w_buff1~0_In745139152) (not .cse2)) (and (or .cse2 .cse0) .cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out745139152| ~z~0_In745139152)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In745139152, ~z$w_buff1_used~0=~z$w_buff1_used~0_In745139152, ~z$w_buff1~0=~z$w_buff1~0_In745139152, ~z~0=~z~0_In745139152} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In745139152, ~z$w_buff1_used~0=~z$w_buff1_used~0_In745139152, ~z$w_buff1~0=~z$w_buff1~0_In745139152, ~z~0=~z~0_In745139152, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out745139152|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out745139152|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 10:20:25,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1110084360 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1110084360 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite40_Out-1110084360| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite40_Out-1110084360| ~z$w_buff0_used~0_In-1110084360) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1110084360, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1110084360} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1110084360, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1110084360, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1110084360|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 10:20:25,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L802-->L802-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-1529251070 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1529251070 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1529251070 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1529251070 256)))) (or (and (= ~z$w_buff1_used~0_In-1529251070 |P2Thread1of1ForFork2_#t~ite41_Out-1529251070|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-1529251070|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1529251070, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1529251070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1529251070, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1529251070} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1529251070|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1529251070, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1529251070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1529251070, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1529251070} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 10:20:25,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1327305483 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1327305483 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1327305483 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1327305483 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1327305483|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-1327305483 |P1Thread1of1ForFork1_#t~ite14_Out-1327305483|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1327305483, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1327305483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1327305483, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1327305483} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1327305483, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1327305483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1327305483, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1327305483|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1327305483} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 10:20:25,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L768-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite14_26| v_~z$r_buff1_thd2~0_70) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_26|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_25|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:20:25,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In138805361 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In138805361 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out138805361|) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In138805361 |P2Thread1of1ForFork2_#t~ite42_Out138805361|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In138805361, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In138805361} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out138805361|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In138805361, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In138805361} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 10:20:25,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In332727980 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In332727980 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In332727980 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In332727980 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In332727980 |P2Thread1of1ForFork2_#t~ite43_Out332727980|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite43_Out332727980|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In332727980, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In332727980, ~z$w_buff1_used~0=~z$w_buff1_used~0_In332727980, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In332727980} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In332727980, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In332727980, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out332727980|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In332727980, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In332727980} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 10:20:25,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L804-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= v_~z$r_buff1_thd3~0_119 |v_P2Thread1of1ForFork2_#t~ite43_26|)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_119, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 10:20:25,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L827-1-->L833: Formula: (and (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_34) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_9 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:20:25,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L833-2-->L833-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite48_Out-1358582275| |ULTIMATE.start_main_#t~ite47_Out-1358582275|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1358582275 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1358582275 256) 0))) (or (and (= ~z$w_buff1~0_In-1358582275 |ULTIMATE.start_main_#t~ite47_Out-1358582275|) (not .cse0) .cse1 (not .cse2)) (and (= ~z~0_In-1358582275 |ULTIMATE.start_main_#t~ite47_Out-1358582275|) .cse1 (or .cse0 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1358582275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1358582275, ~z$w_buff1~0=~z$w_buff1~0_In-1358582275, ~z~0=~z~0_In-1358582275} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1358582275, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1358582275|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1358582275, ~z$w_buff1~0=~z$w_buff1~0_In-1358582275, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1358582275|, ~z~0=~z~0_In-1358582275} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 10:20:25,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In185604816 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In185604816 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In185604816 |ULTIMATE.start_main_#t~ite49_Out185604816|)) (and (= |ULTIMATE.start_main_#t~ite49_Out185604816| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In185604816, ~z$w_buff0_used~0=~z$w_buff0_used~0_In185604816} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In185604816, ~z$w_buff0_used~0=~z$w_buff0_used~0_In185604816, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out185604816|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 10:20:25,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L835-->L835-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-540213841 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-540213841 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-540213841 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-540213841 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-540213841 |ULTIMATE.start_main_#t~ite50_Out-540213841|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-540213841|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-540213841, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-540213841, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-540213841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-540213841} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-540213841|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-540213841, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-540213841, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-540213841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-540213841} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 10:20:25,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In486572563 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In486572563 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In486572563 |ULTIMATE.start_main_#t~ite51_Out486572563|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out486572563|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In486572563, ~z$w_buff0_used~0=~z$w_buff0_used~0_In486572563} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In486572563, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out486572563|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In486572563} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 10:20:25,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L837-->L837-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2116334430 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-2116334430 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2116334430 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2116334430 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-2116334430 |ULTIMATE.start_main_#t~ite52_Out-2116334430|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-2116334430|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2116334430, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2116334430, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2116334430, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2116334430} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2116334430|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2116334430, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2116334430, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2116334430, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2116334430} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 10:20:25,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_27 (ite (= 0 (ite (not (and (= v_~y~0_37 2) (= 2 v_~__unbuffered_p2_EAX~0_30) (= v_~__unbuffered_p2_EBX~0_37 0) (= 2 v_~x~0_117))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= (mod v_~main$tmp_guard1~0_27 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_162 |v_ULTIMATE.start_main_#t~ite52_69|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_69|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~y~0=v_~y~0_37, ~x~0=v_~x~0_117} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_162, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~y~0=v_~y~0_37, ~x~0=v_~x~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:20:25,480 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_16239d5c-95a8-4e33-8b48-2f88adfad9bc/bin/utaipan/witness.graphml [2019-12-07 10:20:25,480 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:20:25,481 INFO L168 Benchmark]: Toolchain (without parser) took 91283.41 ms. Allocated memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: 5.5 GB). Free memory was 938.2 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-12-07 10:20:25,482 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:20:25,482 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -134.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:20:25,482 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.62 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 10:20:25,482 INFO L168 Benchmark]: Boogie Preprocessor took 25.68 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 10:20:25,483 INFO L168 Benchmark]: RCFGBuilder took 405.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:20:25,483 INFO L168 Benchmark]: TraceAbstraction took 90359.47 ms. Allocated memory was 1.1 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-12-07 10:20:25,483 INFO L168 Benchmark]: Witness Printer took 68.54 ms. Allocated memory is still 6.5 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:20:25,484 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -134.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.62 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 25.68 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 405.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 90359.47 ms. Allocated memory was 1.1 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. * Witness Printer took 68.54 ms. Allocated memory is still 6.5 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 175 ProgramPointsBefore, 93 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 6798 VarBasedMoverChecksPositive, 289 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 285 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 87070 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t745, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t746, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t747, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L785] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L786] 3 z$flush_delayed = weak$$choice2 [L787] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=2, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=2, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L788] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L790] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L791] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L792] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=1, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L792] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=1, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L794] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=2, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L801] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L802] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L803] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L836] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 90.1s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 30.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7682 SDtfs, 11970 SDslu, 24456 SDs, 0 SdLazy, 19106 SolverSat, 769 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 551 GetRequests, 58 SyntacticMatches, 47 SemanticMatches, 446 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3143 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151934occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 38.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 450077 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1472 NumberOfCodeBlocks, 1472 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1370 ConstructedInterpolants, 0 QuantifiedInterpolants, 470190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...