./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe024_rmo.opt.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_113b003a-4c1a-4f1c-b89e-efec77df7cd7/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_113b003a-4c1a-4f1c-b89e-efec77df7cd7/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_113b003a-4c1a-4f1c-b89e-efec77df7cd7/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_113b003a-4c1a-4f1c-b89e-efec77df7cd7/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe024_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_113b003a-4c1a-4f1c-b89e-efec77df7cd7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_113b003a-4c1a-4f1c-b89e-efec77df7cd7/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 9ee5fb25ddbc1b3a616c86d1f772edb2fe0af500 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:54:38,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:54:38,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:54:38,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:54:38,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:54:38,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:54:38,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:54:38,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:54:38,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:54:38,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:54:38,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:54:38,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:54:38,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:54:38,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:54:38,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:54:38,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:54:38,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:54:38,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:54:38,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:54:38,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:54:38,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:54:38,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:54:38,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:54:38,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:54:38,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:54:38,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:54:38,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:54:38,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:54:38,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:54:38,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:54:38,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:54:38,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:54:38,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:54:38,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:54:38,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:54:38,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:54:38,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:54:38,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:54:38,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:54:38,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:54:38,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:54:38,528 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_113b003a-4c1a-4f1c-b89e-efec77df7cd7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:54:38,539 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:54:38,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:54:38,539 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:54:38,539 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:54:38,540 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:54:38,540 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:54:38,540 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:54:38,540 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:54:38,540 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:54:38,540 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:54:38,540 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:54:38,541 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:54:38,541 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:54:38,541 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:54:38,541 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:54:38,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:54:38,542 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:54:38,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:54:38,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:54:38,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:54:38,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:54:38,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:54:38,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:54:38,543 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:54:38,543 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:54:38,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:54:38,543 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:54:38,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:54:38,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:54:38,543 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:54:38,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:54:38,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:54:38,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:54:38,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:54:38,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:54:38,544 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:54:38,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:54:38,544 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:54:38,544 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:54:38,544 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:54:38,545 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_113b003a-4c1a-4f1c-b89e-efec77df7cd7/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 -> 9ee5fb25ddbc1b3a616c86d1f772edb2fe0af500 [2019-12-07 12:54:38,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:54:38,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:54:38,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:54:38,653 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:54:38,654 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:54:38,654 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_113b003a-4c1a-4f1c-b89e-efec77df7cd7/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe024_rmo.opt.i [2019-12-07 12:54:38,690 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_113b003a-4c1a-4f1c-b89e-efec77df7cd7/bin/utaipan/data/0f732217a/c070c7fb2a7743ee872c957022d36778/FLAGeccb81280 [2019-12-07 12:54:39,153 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:54:39,153 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_113b003a-4c1a-4f1c-b89e-efec77df7cd7/sv-benchmarks/c/pthread-wmm/safe024_rmo.opt.i [2019-12-07 12:54:39,163 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_113b003a-4c1a-4f1c-b89e-efec77df7cd7/bin/utaipan/data/0f732217a/c070c7fb2a7743ee872c957022d36778/FLAGeccb81280 [2019-12-07 12:54:39,175 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_113b003a-4c1a-4f1c-b89e-efec77df7cd7/bin/utaipan/data/0f732217a/c070c7fb2a7743ee872c957022d36778 [2019-12-07 12:54:39,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:54:39,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:54:39,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:54:39,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:54:39,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:54:39,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:54:39" (1/1) ... [2019-12-07 12:54:39,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8002ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:39, skipping insertion in model container [2019-12-07 12:54:39,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:54:39" (1/1) ... [2019-12-07 12:54:39,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:54:39,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:54:39,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:54:39,487 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:54:39,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:54:39,572 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:54:39,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:39 WrapperNode [2019-12-07 12:54:39,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:54:39,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:54:39,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:54:39,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:54:39,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:39" (1/1) ... [2019-12-07 12:54:39,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:39" (1/1) ... [2019-12-07 12:54:39,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:54:39,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:54:39,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:54:39,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:54:39,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:39" (1/1) ... [2019-12-07 12:54:39,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:39" (1/1) ... [2019-12-07 12:54:39,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:39" (1/1) ... [2019-12-07 12:54:39,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:39" (1/1) ... [2019-12-07 12:54:39,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:39" (1/1) ... [2019-12-07 12:54:39,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:39" (1/1) ... [2019-12-07 12:54:39,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:39" (1/1) ... [2019-12-07 12:54:39,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:54:39,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:54:39,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:54:39,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:54:39,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_113b003a-4c1a-4f1c-b89e-efec77df7cd7/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 12:54:39,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:54:39,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:54:39,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:54:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:54:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:54:39,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:54:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:54:39,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:54:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 12:54:39,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 12:54:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:54:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:54:39,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:54:39,690 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 12:54:40,033 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:54:40,033 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:54:40,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:54:40 BoogieIcfgContainer [2019-12-07 12:54:40,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:54:40,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:54:40,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:54:40,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:54:40,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:54:39" (1/3) ... [2019-12-07 12:54:40,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e92bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:54:40, skipping insertion in model container [2019-12-07 12:54:40,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:39" (2/3) ... [2019-12-07 12:54:40,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e92bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:54:40, skipping insertion in model container [2019-12-07 12:54:40,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:54:40" (3/3) ... [2019-12-07 12:54:40,039 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_rmo.opt.i [2019-12-07 12:54:40,045 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:54:40,045 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:54:40,050 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:54:40,051 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:54:40,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,078 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,078 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,094 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,094 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,094 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,094 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,094 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,098 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,098 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:54:40,115 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 12:54:40,131 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:54:40,132 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:54:40,132 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:54:40,132 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:54:40,132 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:54:40,132 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:54:40,132 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:54:40,132 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:54:40,143 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-07 12:54:40,144 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 12:54:40,194 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 12:54:40,195 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:54:40,205 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 726 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 12:54:40,220 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 12:54:40,248 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 12:54:40,248 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:54:40,254 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 726 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 12:54:40,270 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 12:54:40,271 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:54:43,339 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 12:54:43,426 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-07 12:54:43,426 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 12:54:43,429 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-07 12:54:53,609 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-07 12:54:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-07 12:54:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 12:54:53,615 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:53,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 12:54:53,615 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:53,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:53,619 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-07 12:54:53,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:54:53,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330893030] [2019-12-07 12:54:53,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:53,763 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 12:54:53,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330893030] [2019-12-07 12:54:53,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:53,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:54:53,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619438901] [2019-12-07 12:54:53,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:54:53,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:54:53,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:54:53,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:54:53,779 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-07 12:54:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:54,519 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-07 12:54:54,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:54:54,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 12:54:54,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:54,915 INFO L225 Difference]: With dead ends: 87834 [2019-12-07 12:54:54,915 INFO L226 Difference]: Without dead ends: 82738 [2019-12-07 12:54:54,916 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 12:54:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-07 12:54:59,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-07 12:54:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-07 12:54:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-07 12:54:59,981 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-07 12:54:59,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:59,982 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-07 12:54:59,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:54:59,982 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-07 12:54:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:54:59,990 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:59,990 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:59,990 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:59,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:59,990 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-07 12:54:59,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:54:59,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763940761] [2019-12-07 12:54:59,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:00,063 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 12:55:00,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763940761] [2019-12-07 12:55:00,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:00,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:55:00,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980456153] [2019-12-07 12:55:00,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:55:00,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:00,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:55:00,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:55:00,065 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-07 12:55:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:01,827 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-07 12:55:01,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:55:01,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 12:55:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:02,150 INFO L225 Difference]: With dead ends: 127286 [2019-12-07 12:55:02,150 INFO L226 Difference]: Without dead ends: 127202 [2019-12-07 12:55:02,151 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 12:55:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-07 12:55:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-07 12:55:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-07 12:55:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-07 12:55:08,227 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-07 12:55:08,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:08,228 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-07 12:55:08,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:55:08,228 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-07 12:55:08,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:55:08,231 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:08,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:08,231 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:08,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:08,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-07 12:55:08,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:08,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229406673] [2019-12-07 12:55:08,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:08,267 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 12:55:08,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229406673] [2019-12-07 12:55:08,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:08,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:55:08,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680865485] [2019-12-07 12:55:08,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:08,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:08,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:08,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:08,268 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-07 12:55:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:08,351 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-07 12:55:08,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:08,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 12:55:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:08,397 INFO L225 Difference]: With dead ends: 28492 [2019-12-07 12:55:08,397 INFO L226 Difference]: Without dead ends: 28492 [2019-12-07 12:55:08,397 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 12:55:08,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-07 12:55:09,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-07 12:55:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-07 12:55:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-07 12:55:09,135 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-07 12:55:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:09,135 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-07 12:55:09,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-07 12:55:09,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:55:09,136 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:09,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:09,136 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:09,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:09,137 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-07 12:55:09,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:09,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61546109] [2019-12-07 12:55:09,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:09,190 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 12:55:09,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61546109] [2019-12-07 12:55:09,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:09,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:09,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181249572] [2019-12-07 12:55:09,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:55:09,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:09,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:55:09,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:55:09,192 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-07 12:55:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:09,495 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-07 12:55:09,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:55:09,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 12:55:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:09,555 INFO L225 Difference]: With dead ends: 41156 [2019-12-07 12:55:09,555 INFO L226 Difference]: Without dead ends: 41141 [2019-12-07 12:55:09,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:55:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-07 12:55:10,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-07 12:55:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-07 12:55:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-07 12:55:10,164 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-07 12:55:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:10,164 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-07 12:55:10,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:55:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-07 12:55:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:55:10,171 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:10,171 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 12:55:10,171 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:10,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:10,171 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-07 12:55:10,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:10,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894912342] [2019-12-07 12:55:10,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:10,246 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 12:55:10,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894912342] [2019-12-07 12:55:10,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:10,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:55:10,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572311790] [2019-12-07 12:55:10,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:55:10,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:10,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:55:10,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:55:10,248 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-07 12:55:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:10,802 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-07 12:55:10,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:55:10,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 12:55:10,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:10,872 INFO L225 Difference]: With dead ends: 48363 [2019-12-07 12:55:10,872 INFO L226 Difference]: Without dead ends: 48336 [2019-12-07 12:55:10,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:55:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-07 12:55:12,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-07 12:55:12,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-07 12:55:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-07 12:55:12,225 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-07 12:55:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:12,225 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-07 12:55:12,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:55:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-07 12:55:12,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:55:12,236 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:12,236 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 12:55:12,236 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:12,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:12,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-07 12:55:12,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:12,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952191815] [2019-12-07 12:55:12,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:12,278 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 12:55:12,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952191815] [2019-12-07 12:55:12,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:12,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:12,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187794616] [2019-12-07 12:55:12,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:55:12,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:12,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:55:12,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:55:12,279 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-07 12:55:12,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:12,330 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-07 12:55:12,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:55:12,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 12:55:12,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:12,347 INFO L225 Difference]: With dead ends: 12861 [2019-12-07 12:55:12,347 INFO L226 Difference]: Without dead ends: 12861 [2019-12-07 12:55:12,347 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 12:55:12,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-07 12:55:12,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-07 12:55:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-07 12:55:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-07 12:55:12,522 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-07 12:55:12,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:12,523 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-07 12:55:12,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:55:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-07 12:55:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 12:55:12,537 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:12,537 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] [2019-12-07 12:55:12,537 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:12,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:12,537 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-07 12:55:12,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:12,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351820487] [2019-12-07 12:55:12,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:12,583 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 12:55:12,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351820487] [2019-12-07 12:55:12,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:12,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:55:12,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091853510] [2019-12-07 12:55:12,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:55:12,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:12,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:55:12,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:55:12,584 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-07 12:55:12,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:12,626 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-07 12:55:12,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:55:12,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 12:55:12,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:12,640 INFO L225 Difference]: With dead ends: 11425 [2019-12-07 12:55:12,641 INFO L226 Difference]: Without dead ends: 11425 [2019-12-07 12:55:12,641 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 12:55:12,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-07 12:55:12,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-07 12:55:12,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-07 12:55:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-07 12:55:12,800 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-07 12:55:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:12,801 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-07 12:55:12,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:55:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-07 12:55:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 12:55:12,815 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:12,815 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:12,815 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:12,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:12,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-07 12:55:12,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:12,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19279119] [2019-12-07 12:55:12,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:12,882 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 12:55:12,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19279119] [2019-12-07 12:55:12,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:12,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:55:12,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829188871] [2019-12-07 12:55:12,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:55:12,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:12,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:55:12,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:55:12,884 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 5 states. [2019-12-07 12:55:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,164 INFO L93 Difference]: Finished difference Result 15852 states and 48728 transitions. [2019-12-07 12:55:13,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:55:13,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-07 12:55:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,183 INFO L225 Difference]: With dead ends: 15852 [2019-12-07 12:55:13,183 INFO L226 Difference]: Without dead ends: 15852 [2019-12-07 12:55:13,183 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 12:55:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15852 states. [2019-12-07 12:55:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15852 to 14457. [2019-12-07 12:55:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14457 states. [2019-12-07 12:55:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14457 states to 14457 states and 44700 transitions. [2019-12-07 12:55:13,393 INFO L78 Accepts]: Start accepts. Automaton has 14457 states and 44700 transitions. Word has length 53 [2019-12-07 12:55:13,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:13,393 INFO L462 AbstractCegarLoop]: Abstraction has 14457 states and 44700 transitions. [2019-12-07 12:55:13,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:55:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 14457 states and 44700 transitions. [2019-12-07 12:55:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 12:55:13,411 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:13,411 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:13,411 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:13,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:13,411 INFO L82 PathProgramCache]: Analyzing trace with hash 194850767, now seen corresponding path program 2 times [2019-12-07 12:55:13,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:13,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451489469] [2019-12-07 12:55:13,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,481 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 12:55:13,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451489469] [2019-12-07 12:55:13,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:13,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:55:13,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944697732] [2019-12-07 12:55:13,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:55:13,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:13,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:55:13,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:55:13,483 INFO L87 Difference]: Start difference. First operand 14457 states and 44700 transitions. Second operand 6 states. [2019-12-07 12:55:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,888 INFO L93 Difference]: Finished difference Result 25137 states and 77688 transitions. [2019-12-07 12:55:13,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:55:13,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-07 12:55:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,917 INFO L225 Difference]: With dead ends: 25137 [2019-12-07 12:55:13,918 INFO L226 Difference]: Without dead ends: 25137 [2019-12-07 12:55:13,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:55:14,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25137 states. [2019-12-07 12:55:14,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25137 to 16137. [2019-12-07 12:55:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16137 states. [2019-12-07 12:55:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16137 states to 16137 states and 49947 transitions. [2019-12-07 12:55:14,207 INFO L78 Accepts]: Start accepts. Automaton has 16137 states and 49947 transitions. Word has length 53 [2019-12-07 12:55:14,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:14,207 INFO L462 AbstractCegarLoop]: Abstraction has 16137 states and 49947 transitions. [2019-12-07 12:55:14,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:55:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 16137 states and 49947 transitions. [2019-12-07 12:55:14,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 12:55:14,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:14,227 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:14,227 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:14,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:14,227 INFO L82 PathProgramCache]: Analyzing trace with hash 690646521, now seen corresponding path program 3 times [2019-12-07 12:55:14,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:14,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572326196] [2019-12-07 12:55:14,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:14,276 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 12:55:14,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572326196] [2019-12-07 12:55:14,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:14,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:55:14,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055810941] [2019-12-07 12:55:14,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:14,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:14,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:14,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:14,278 INFO L87 Difference]: Start difference. First operand 16137 states and 49947 transitions. Second operand 3 states. [2019-12-07 12:55:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:14,321 INFO L93 Difference]: Finished difference Result 16135 states and 49942 transitions. [2019-12-07 12:55:14,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:14,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 12:55:14,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:14,339 INFO L225 Difference]: With dead ends: 16135 [2019-12-07 12:55:14,339 INFO L226 Difference]: Without dead ends: 16135 [2019-12-07 12:55:14,339 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 12:55:14,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16135 states. [2019-12-07 12:55:14,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16135 to 14837. [2019-12-07 12:55:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14837 states. [2019-12-07 12:55:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14837 states to 14837 states and 46243 transitions. [2019-12-07 12:55:14,559 INFO L78 Accepts]: Start accepts. Automaton has 14837 states and 46243 transitions. Word has length 53 [2019-12-07 12:55:14,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:14,559 INFO L462 AbstractCegarLoop]: Abstraction has 14837 states and 46243 transitions. [2019-12-07 12:55:14,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:14,559 INFO L276 IsEmpty]: Start isEmpty. Operand 14837 states and 46243 transitions. [2019-12-07 12:55:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 12:55:14,572 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:14,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:14,572 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:14,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:14,572 INFO L82 PathProgramCache]: Analyzing trace with hash 95954180, now seen corresponding path program 1 times [2019-12-07 12:55:14,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:14,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498119436] [2019-12-07 12:55:14,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:14,611 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 12:55:14,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498119436] [2019-12-07 12:55:14,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:14,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:55:14,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15050648] [2019-12-07 12:55:14,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:14,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:14,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:14,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:14,612 INFO L87 Difference]: Start difference. First operand 14837 states and 46243 transitions. Second operand 3 states. [2019-12-07 12:55:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:14,707 INFO L93 Difference]: Finished difference Result 12626 states and 38826 transitions. [2019-12-07 12:55:14,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:14,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 12:55:14,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:14,720 INFO L225 Difference]: With dead ends: 12626 [2019-12-07 12:55:14,720 INFO L226 Difference]: Without dead ends: 12626 [2019-12-07 12:55:14,720 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 12:55:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12626 states. [2019-12-07 12:55:14,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12626 to 12098. [2019-12-07 12:55:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12098 states. [2019-12-07 12:55:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12098 states to 12098 states and 37286 transitions. [2019-12-07 12:55:14,888 INFO L78 Accepts]: Start accepts. Automaton has 12098 states and 37286 transitions. Word has length 54 [2019-12-07 12:55:14,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:14,888 INFO L462 AbstractCegarLoop]: Abstraction has 12098 states and 37286 transitions. [2019-12-07 12:55:14,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:14,888 INFO L276 IsEmpty]: Start isEmpty. Operand 12098 states and 37286 transitions. [2019-12-07 12:55:14,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 12:55:14,899 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:14,899 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] [2019-12-07 12:55:14,899 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:14,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:14,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2064257105, now seen corresponding path program 1 times [2019-12-07 12:55:14,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:14,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410005055] [2019-12-07 12:55:14,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:15,050 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 12:55:15,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410005055] [2019-12-07 12:55:15,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:15,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:55:15,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961856605] [2019-12-07 12:55:15,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:55:15,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:15,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:55:15,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:55:15,051 INFO L87 Difference]: Start difference. First operand 12098 states and 37286 transitions. Second operand 10 states. [2019-12-07 12:55:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:15,773 INFO L93 Difference]: Finished difference Result 50825 states and 156248 transitions. [2019-12-07 12:55:15,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 12:55:15,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-07 12:55:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:15,829 INFO L225 Difference]: With dead ends: 50825 [2019-12-07 12:55:15,829 INFO L226 Difference]: Without dead ends: 48155 [2019-12-07 12:55:15,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-12-07 12:55:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48155 states. [2019-12-07 12:55:16,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48155 to 14430. [2019-12-07 12:55:16,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14430 states. [2019-12-07 12:55:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14430 states to 14430 states and 45305 transitions. [2019-12-07 12:55:16,272 INFO L78 Accepts]: Start accepts. Automaton has 14430 states and 45305 transitions. Word has length 55 [2019-12-07 12:55:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:16,272 INFO L462 AbstractCegarLoop]: Abstraction has 14430 states and 45305 transitions. [2019-12-07 12:55:16,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:55:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 14430 states and 45305 transitions. [2019-12-07 12:55:16,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 12:55:16,285 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:16,285 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] [2019-12-07 12:55:16,285 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:16,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:16,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1492343505, now seen corresponding path program 2 times [2019-12-07 12:55:16,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:16,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867536640] [2019-12-07 12:55:16,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:16,460 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 12:55:16,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867536640] [2019-12-07 12:55:16,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:16,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 12:55:16,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910308545] [2019-12-07 12:55:16,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:55:16,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:16,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:55:16,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:55:16,461 INFO L87 Difference]: Start difference. First operand 14430 states and 45305 transitions. Second operand 11 states. [2019-12-07 12:55:17,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:17,352 INFO L93 Difference]: Finished difference Result 46190 states and 141956 transitions. [2019-12-07 12:55:17,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 12:55:17,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 12:55:17,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:17,376 INFO L225 Difference]: With dead ends: 46190 [2019-12-07 12:55:17,376 INFO L226 Difference]: Without dead ends: 22724 [2019-12-07 12:55:17,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2019-12-07 12:55:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22724 states. [2019-12-07 12:55:17,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22724 to 12355. [2019-12-07 12:55:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12355 states. [2019-12-07 12:55:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12355 states to 12355 states and 38484 transitions. [2019-12-07 12:55:17,638 INFO L78 Accepts]: Start accepts. Automaton has 12355 states and 38484 transitions. Word has length 55 [2019-12-07 12:55:17,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:17,638 INFO L462 AbstractCegarLoop]: Abstraction has 12355 states and 38484 transitions. [2019-12-07 12:55:17,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:55:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 12355 states and 38484 transitions. [2019-12-07 12:55:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 12:55:17,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:17,650 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] [2019-12-07 12:55:17,650 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:17,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:17,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1024706095, now seen corresponding path program 3 times [2019-12-07 12:55:17,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:17,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733863869] [2019-12-07 12:55:17,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:17,791 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 12:55:17,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733863869] [2019-12-07 12:55:17,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:17,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:55:17,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341600639] [2019-12-07 12:55:17,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:55:17,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:17,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:55:17,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:55:17,792 INFO L87 Difference]: Start difference. First operand 12355 states and 38484 transitions. Second operand 11 states. [2019-12-07 12:55:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:18,512 INFO L93 Difference]: Finished difference Result 28935 states and 90015 transitions. [2019-12-07 12:55:18,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 12:55:18,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 12:55:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:18,545 INFO L225 Difference]: With dead ends: 28935 [2019-12-07 12:55:18,545 INFO L226 Difference]: Without dead ends: 27601 [2019-12-07 12:55:18,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=271, Invalid=1135, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 12:55:18,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27601 states. [2019-12-07 12:55:18,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27601 to 18528. [2019-12-07 12:55:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18528 states. [2019-12-07 12:55:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18528 states to 18528 states and 58055 transitions. [2019-12-07 12:55:18,898 INFO L78 Accepts]: Start accepts. Automaton has 18528 states and 58055 transitions. Word has length 55 [2019-12-07 12:55:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:18,898 INFO L462 AbstractCegarLoop]: Abstraction has 18528 states and 58055 transitions. [2019-12-07 12:55:18,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:55:18,898 INFO L276 IsEmpty]: Start isEmpty. Operand 18528 states and 58055 transitions. [2019-12-07 12:55:18,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 12:55:18,913 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:18,913 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] [2019-12-07 12:55:18,913 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:18,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:18,914 INFO L82 PathProgramCache]: Analyzing trace with hash 621327827, now seen corresponding path program 4 times [2019-12-07 12:55:18,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:18,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125117118] [2019-12-07 12:55:18,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:19,109 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 12:55:19,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125117118] [2019-12-07 12:55:19,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:19,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:55:19,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795177548] [2019-12-07 12:55:19,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:55:19,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:19,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:55:19,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:55:19,110 INFO L87 Difference]: Start difference. First operand 18528 states and 58055 transitions. Second operand 11 states. [2019-12-07 12:55:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:19,664 INFO L93 Difference]: Finished difference Result 28290 states and 87457 transitions. [2019-12-07 12:55:19,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 12:55:19,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 12:55:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:19,687 INFO L225 Difference]: With dead ends: 28290 [2019-12-07 12:55:19,687 INFO L226 Difference]: Without dead ends: 21173 [2019-12-07 12:55:19,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2019-12-07 12:55:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21173 states. [2019-12-07 12:55:19,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21173 to 14394. [2019-12-07 12:55:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14394 states. [2019-12-07 12:55:19,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14394 states to 14394 states and 44126 transitions. [2019-12-07 12:55:19,937 INFO L78 Accepts]: Start accepts. Automaton has 14394 states and 44126 transitions. Word has length 55 [2019-12-07 12:55:19,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:19,937 INFO L462 AbstractCegarLoop]: Abstraction has 14394 states and 44126 transitions. [2019-12-07 12:55:19,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:55:19,937 INFO L276 IsEmpty]: Start isEmpty. Operand 14394 states and 44126 transitions. [2019-12-07 12:55:19,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 12:55:19,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:19,949 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] [2019-12-07 12:55:19,949 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:19,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:19,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 5 times [2019-12-07 12:55:19,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:19,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426042029] [2019-12-07 12:55:19,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:20,056 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 12:55:20,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426042029] [2019-12-07 12:55:20,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:20,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 12:55:20,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302926056] [2019-12-07 12:55:20,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:55:20,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:20,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:55:20,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:55:20,057 INFO L87 Difference]: Start difference. First operand 14394 states and 44126 transitions. Second operand 12 states. [2019-12-07 12:55:20,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:20,660 INFO L93 Difference]: Finished difference Result 21665 states and 65465 transitions. [2019-12-07 12:55:20,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 12:55:20,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-07 12:55:20,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:20,683 INFO L225 Difference]: With dead ends: 21665 [2019-12-07 12:55:20,684 INFO L226 Difference]: Without dead ends: 20633 [2019-12-07 12:55:20,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2019-12-07 12:55:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20633 states. [2019-12-07 12:55:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20633 to 14035. [2019-12-07 12:55:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14035 states. [2019-12-07 12:55:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14035 states to 14035 states and 43127 transitions. [2019-12-07 12:55:20,931 INFO L78 Accepts]: Start accepts. Automaton has 14035 states and 43127 transitions. Word has length 55 [2019-12-07 12:55:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:20,931 INFO L462 AbstractCegarLoop]: Abstraction has 14035 states and 43127 transitions. [2019-12-07 12:55:20,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:55:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 14035 states and 43127 transitions. [2019-12-07 12:55:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 12:55:20,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:20,943 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] [2019-12-07 12:55:20,943 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:20,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:20,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 6 times [2019-12-07 12:55:20,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:20,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322954383] [2019-12-07 12:55:20,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:55:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:55:21,003 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 12:55:21,003 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:55:21,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2360~0.base_24| 4) |v_#length_23|) (= 0 v_~x$w_buff1_used~0_531) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2360~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2360~0.base_24|) |v_ULTIMATE.start_main_~#t2360~0.offset_18| 0)) |v_#memory_int_23|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2360~0.base_24|)) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2360~0.base_24|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 |v_ULTIMATE.start_main_~#t2360~0.offset_18|) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2360~0.base_24| 1)) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ULTIMATE.start_main_~#t2362~0.offset=|v_ULTIMATE.start_main_~#t2362~0.offset_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2360~0.base=|v_ULTIMATE.start_main_~#t2360~0.base_24|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_~#t2361~0.base=|v_ULTIMATE.start_main_~#t2361~0.base_26|, ULTIMATE.start_main_~#t2361~0.offset=|v_ULTIMATE.start_main_~#t2361~0.offset_19|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2362~0.base=|v_ULTIMATE.start_main_~#t2362~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2360~0.offset=|v_ULTIMATE.start_main_~#t2360~0.offset_18|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2362~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2360~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2361~0.base, ULTIMATE.start_main_~#t2361~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2362~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ULTIMATE.start_main_~#t2360~0.offset, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 12:55:21,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2361~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t2361~0.offset_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2361~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2361~0.base_13|) |v_ULTIMATE.start_main_~#t2361~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2361~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2361~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t2361~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2361~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2361~0.base=|v_ULTIMATE.start_main_~#t2361~0.base_13|, ULTIMATE.start_main_~#t2361~0.offset=|v_ULTIMATE.start_main_~#t2361~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2361~0.base, ULTIMATE.start_main_~#t2361~0.offset] because there is no mapped edge [2019-12-07 12:55:21,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2362~0.base_13| 1) |v_#valid_38|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2362~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t2362~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2362~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t2362~0.offset_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2362~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2362~0.base_13|) |v_ULTIMATE.start_main_~#t2362~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2362~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2362~0.offset=|v_ULTIMATE.start_main_~#t2362~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2362~0.base=|v_ULTIMATE.start_main_~#t2362~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2362~0.offset, ULTIMATE.start_main_~#t2362~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 12:55:21,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= ~x$w_buff1_used~0_Out-1265204604 ~x$w_buff0_used~0_In-1265204604) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1265204604| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1265204604) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1265204604| (ite (not (and (not (= (mod ~x$w_buff1_used~0_Out-1265204604 256) 0)) (not (= (mod ~x$w_buff0_used~0_Out-1265204604 256) 0)))) 1 0)) (= 1 ~x$w_buff0~0_Out-1265204604) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1265204604 0)) (= |P1Thread1of1ForFork0_#in~arg.base_In-1265204604| P1Thread1of1ForFork0_~arg.base_Out-1265204604) (= ~x$w_buff0_used~0_Out-1265204604 1) (= |P1Thread1of1ForFork0_#in~arg.offset_In-1265204604| P1Thread1of1ForFork0_~arg.offset_Out-1265204604) (= ~x$w_buff0~0_In-1265204604 ~x$w_buff1~0_Out-1265204604)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1265204604, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1265204604|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1265204604|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1265204604} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-1265204604, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1265204604, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-1265204604, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-1265204604, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1265204604|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1265204604|, ~x$w_buff1~0=~x$w_buff1~0_Out-1265204604, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1265204604|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1265204604, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1265204604} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 12:55:21,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-378767418 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-378767418 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-378767418| ~x~0_In-378767418)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-378767418| ~x$w_buff1~0_In-378767418) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-378767418, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-378767418, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-378767418, ~x~0=~x~0_In-378767418} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-378767418|, ~x$w_buff1~0=~x$w_buff1~0_In-378767418, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-378767418, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-378767418, ~x~0=~x~0_In-378767418} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 12:55:21,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_27|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 12:55:21,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-392233060 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-392233060 256) 0))) (or (and (= ~x$w_buff0_used~0_In-392233060 |P2Thread1of1ForFork1_#t~ite34_Out-392233060|) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-392233060| 0) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-392233060, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392233060} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-392233060|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-392233060, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392233060} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 12:55:21,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1340282609 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1340282609 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1340282609| ~x$w_buff0_used~0_In-1340282609)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1340282609| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1340282609, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1340282609} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1340282609, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1340282609|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1340282609} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 12:55:21,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1591694833 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1591694833 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1591694833 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1591694833 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out1591694833| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out1591694833| ~x$w_buff1_used~0_In1591694833)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1591694833, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1591694833, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1591694833, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1591694833} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1591694833, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1591694833, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1591694833, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1591694833|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1591694833} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 12:55:21,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_In-2099130540 ~x$r_buff0_thd2~0_Out-2099130540)) (.cse0 (= (mod ~x$w_buff0_used~0_In-2099130540 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2099130540 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-2099130540) (not .cse2)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2099130540, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2099130540} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-2099130540|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2099130540, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2099130540} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 12:55:21,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In570055614 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In570055614 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In570055614 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In570055614 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out570055614|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In570055614 |P1Thread1of1ForFork0_#t~ite31_Out570055614|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In570055614, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In570055614, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In570055614, ~x$w_buff0_used~0=~x$w_buff0_used~0_In570055614} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out570055614|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In570055614, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In570055614, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In570055614, ~x$w_buff0_used~0=~x$w_buff0_used~0_In570055614} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 12:55:21,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 12:55:21,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-506856340 256)))) (or (and (= ~x$w_buff1~0_In-506856340 |P0Thread1of1ForFork2_#t~ite11_Out-506856340|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-506856340 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-506856340 256)) .cse1) (and (= 0 (mod ~x$r_buff1_thd1~0_In-506856340 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-506856340 256) 0))) (= |P0Thread1of1ForFork2_#t~ite12_Out-506856340| |P0Thread1of1ForFork2_#t~ite11_Out-506856340|)) (and (= |P0Thread1of1ForFork2_#t~ite12_Out-506856340| ~x$w_buff1~0_In-506856340) (= |P0Thread1of1ForFork2_#t~ite11_In-506856340| |P0Thread1of1ForFork2_#t~ite11_Out-506856340|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-506856340, ~x$w_buff1~0=~x$w_buff1~0_In-506856340, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-506856340, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-506856340, ~weak$$choice2~0=~weak$$choice2~0_In-506856340, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-506856340|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-506856340} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-506856340, ~x$w_buff1~0=~x$w_buff1~0_In-506856340, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-506856340, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-506856340, ~weak$$choice2~0=~weak$$choice2~0_In-506856340, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-506856340|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-506856340|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-506856340} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 12:55:21,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1321631587 256)))) (or (and (= ~x$w_buff0_used~0_In1321631587 |P0Thread1of1ForFork2_#t~ite15_Out1321631587|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In1321631587| |P0Thread1of1ForFork2_#t~ite14_Out1321631587|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1321631587 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1321631587 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In1321631587 256)) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1321631587 256))))) (= |P0Thread1of1ForFork2_#t~ite14_Out1321631587| |P0Thread1of1ForFork2_#t~ite15_Out1321631587|) .cse0 (= ~x$w_buff0_used~0_In1321631587 |P0Thread1of1ForFork2_#t~ite14_Out1321631587|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1321631587, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1321631587, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1321631587, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1321631587|, ~weak$$choice2~0=~weak$$choice2~0_In1321631587, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1321631587} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1321631587, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1321631587, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1321631587|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1321631587, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1321631587|, ~weak$$choice2~0=~weak$$choice2~0_In1321631587, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1321631587} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 12:55:21,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-371537585 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite18_Out-371537585| ~x$w_buff1_used~0_In-371537585) (= |P0Thread1of1ForFork2_#t~ite17_In-371537585| |P0Thread1of1ForFork2_#t~ite17_Out-371537585|)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite18_Out-371537585| |P0Thread1of1ForFork2_#t~ite17_Out-371537585|) (= ~x$w_buff1_used~0_In-371537585 |P0Thread1of1ForFork2_#t~ite17_Out-371537585|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-371537585 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-371537585 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In-371537585 256) 0)) (and (= (mod ~x$r_buff1_thd1~0_In-371537585 256) 0) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-371537585, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-371537585|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-371537585, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-371537585, ~weak$$choice2~0=~weak$$choice2~0_In-371537585, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-371537585} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-371537585, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-371537585|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-371537585|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-371537585, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-371537585, ~weak$$choice2~0=~weak$$choice2~0_In-371537585, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-371537585} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 12:55:21,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_33|) (= |v_P0Thread1of1ForFork2_#t~ite22_34| |v_P0Thread1of1ForFork2_#t~ite22_33|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= |v_P0Thread1of1ForFork2_#t~ite23_38| |v_P0Thread1of1ForFork2_#t~ite23_37|) (not (= 0 (mod v_~weak$$choice2~0_142 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_38|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_34|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_33|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_37|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_33|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 12:55:21,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 12:55:21,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1577997030 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1577997030 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1577997030 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1577997030 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-1577997030| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite35_Out-1577997030| ~x$w_buff1_used~0_In-1577997030)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1577997030, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1577997030, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1577997030, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1577997030} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1577997030|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1577997030, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1577997030, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1577997030, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1577997030} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 12:55:21,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-778828099 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-778828099 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-778828099|)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-778828099 |P2Thread1of1ForFork1_#t~ite36_Out-778828099|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-778828099, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-778828099} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-778828099|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-778828099, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-778828099} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 12:55:21,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In2061591043 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2061591043 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In2061591043 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In2061591043 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out2061591043| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite37_Out2061591043| ~x$r_buff1_thd3~0_In2061591043)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2061591043, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2061591043, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2061591043, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2061591043} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out2061591043|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2061591043, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2061591043, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2061591043, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2061591043} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:55:21,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_38|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 12:55:21,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:55:21,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1916082085 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1916082085 256)))) (or (and (= ~x$w_buff1~0_In1916082085 |ULTIMATE.start_main_#t~ite41_Out1916082085|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out1916082085| ~x~0_In1916082085) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1916082085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1916082085, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1916082085, ~x~0=~x~0_In1916082085} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1916082085|, ~x$w_buff1~0=~x$w_buff1~0_In1916082085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1916082085, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1916082085, ~x~0=~x~0_In1916082085} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 12:55:21,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 12:55:21,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-844217014 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-844217014 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-844217014| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-844217014| ~x$w_buff0_used~0_In-844217014)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-844217014, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-844217014} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-844217014, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-844217014|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-844217014} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 12:55:21,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1634917487 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1634917487 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1634917487 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1634917487 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-1634917487| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-1634917487 |ULTIMATE.start_main_#t~ite44_Out-1634917487|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1634917487, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1634917487, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1634917487, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1634917487} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1634917487, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1634917487, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1634917487, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1634917487|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1634917487} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:55:21,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1368212079 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1368212079 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1368212079|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1368212079 |ULTIMATE.start_main_#t~ite45_Out-1368212079|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1368212079, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1368212079} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1368212079, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1368212079|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1368212079} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 12:55:21,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In-982344571 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-982344571 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-982344571 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-982344571 256)))) (or (and (= ~x$r_buff1_thd0~0_In-982344571 |ULTIMATE.start_main_#t~ite46_Out-982344571|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite46_Out-982344571| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-982344571, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-982344571, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-982344571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-982344571} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-982344571, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-982344571|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-982344571, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-982344571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-982344571} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 12:55:21,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:55:21,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:55:21 BasicIcfg [2019-12-07 12:55:21,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:55:21,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:55:21,063 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:55:21,063 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:55:21,063 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:54:40" (3/4) ... [2019-12-07 12:55:21,065 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:55:21,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2360~0.base_24| 4) |v_#length_23|) (= 0 v_~x$w_buff1_used~0_531) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2360~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2360~0.base_24|) |v_ULTIMATE.start_main_~#t2360~0.offset_18| 0)) |v_#memory_int_23|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2360~0.base_24|)) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2360~0.base_24|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 |v_ULTIMATE.start_main_~#t2360~0.offset_18|) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2360~0.base_24| 1)) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ULTIMATE.start_main_~#t2362~0.offset=|v_ULTIMATE.start_main_~#t2362~0.offset_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2360~0.base=|v_ULTIMATE.start_main_~#t2360~0.base_24|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_~#t2361~0.base=|v_ULTIMATE.start_main_~#t2361~0.base_26|, ULTIMATE.start_main_~#t2361~0.offset=|v_ULTIMATE.start_main_~#t2361~0.offset_19|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2362~0.base=|v_ULTIMATE.start_main_~#t2362~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2360~0.offset=|v_ULTIMATE.start_main_~#t2360~0.offset_18|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2362~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2360~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2361~0.base, ULTIMATE.start_main_~#t2361~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2362~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ULTIMATE.start_main_~#t2360~0.offset, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 12:55:21,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2361~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t2361~0.offset_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2361~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2361~0.base_13|) |v_ULTIMATE.start_main_~#t2361~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2361~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2361~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t2361~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2361~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2361~0.base=|v_ULTIMATE.start_main_~#t2361~0.base_13|, ULTIMATE.start_main_~#t2361~0.offset=|v_ULTIMATE.start_main_~#t2361~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2361~0.base, ULTIMATE.start_main_~#t2361~0.offset] because there is no mapped edge [2019-12-07 12:55:21,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2362~0.base_13| 1) |v_#valid_38|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2362~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t2362~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2362~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t2362~0.offset_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2362~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2362~0.base_13|) |v_ULTIMATE.start_main_~#t2362~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2362~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2362~0.offset=|v_ULTIMATE.start_main_~#t2362~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2362~0.base=|v_ULTIMATE.start_main_~#t2362~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2362~0.offset, ULTIMATE.start_main_~#t2362~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 12:55:21,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= ~x$w_buff1_used~0_Out-1265204604 ~x$w_buff0_used~0_In-1265204604) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1265204604| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1265204604) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1265204604| (ite (not (and (not (= (mod ~x$w_buff1_used~0_Out-1265204604 256) 0)) (not (= (mod ~x$w_buff0_used~0_Out-1265204604 256) 0)))) 1 0)) (= 1 ~x$w_buff0~0_Out-1265204604) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1265204604 0)) (= |P1Thread1of1ForFork0_#in~arg.base_In-1265204604| P1Thread1of1ForFork0_~arg.base_Out-1265204604) (= ~x$w_buff0_used~0_Out-1265204604 1) (= |P1Thread1of1ForFork0_#in~arg.offset_In-1265204604| P1Thread1of1ForFork0_~arg.offset_Out-1265204604) (= ~x$w_buff0~0_In-1265204604 ~x$w_buff1~0_Out-1265204604)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1265204604, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1265204604|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1265204604|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1265204604} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-1265204604, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1265204604, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-1265204604, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-1265204604, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1265204604|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1265204604|, ~x$w_buff1~0=~x$w_buff1~0_Out-1265204604, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1265204604|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1265204604, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1265204604} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 12:55:21,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-378767418 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-378767418 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-378767418| ~x~0_In-378767418)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-378767418| ~x$w_buff1~0_In-378767418) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-378767418, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-378767418, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-378767418, ~x~0=~x~0_In-378767418} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-378767418|, ~x$w_buff1~0=~x$w_buff1~0_In-378767418, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-378767418, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-378767418, ~x~0=~x~0_In-378767418} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 12:55:21,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_27|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 12:55:21,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-392233060 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-392233060 256) 0))) (or (and (= ~x$w_buff0_used~0_In-392233060 |P2Thread1of1ForFork1_#t~ite34_Out-392233060|) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-392233060| 0) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-392233060, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392233060} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-392233060|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-392233060, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392233060} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 12:55:21,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1340282609 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1340282609 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1340282609| ~x$w_buff0_used~0_In-1340282609)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1340282609| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1340282609, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1340282609} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1340282609, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1340282609|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1340282609} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 12:55:21,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1591694833 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1591694833 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1591694833 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1591694833 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out1591694833| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out1591694833| ~x$w_buff1_used~0_In1591694833)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1591694833, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1591694833, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1591694833, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1591694833} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1591694833, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1591694833, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1591694833, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1591694833|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1591694833} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 12:55:21,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_In-2099130540 ~x$r_buff0_thd2~0_Out-2099130540)) (.cse0 (= (mod ~x$w_buff0_used~0_In-2099130540 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2099130540 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-2099130540) (not .cse2)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2099130540, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2099130540} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-2099130540|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2099130540, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2099130540} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 12:55:21,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In570055614 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In570055614 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In570055614 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In570055614 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out570055614|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In570055614 |P1Thread1of1ForFork0_#t~ite31_Out570055614|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In570055614, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In570055614, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In570055614, ~x$w_buff0_used~0=~x$w_buff0_used~0_In570055614} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out570055614|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In570055614, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In570055614, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In570055614, ~x$w_buff0_used~0=~x$w_buff0_used~0_In570055614} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 12:55:21,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 12:55:21,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-506856340 256)))) (or (and (= ~x$w_buff1~0_In-506856340 |P0Thread1of1ForFork2_#t~ite11_Out-506856340|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-506856340 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-506856340 256)) .cse1) (and (= 0 (mod ~x$r_buff1_thd1~0_In-506856340 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-506856340 256) 0))) (= |P0Thread1of1ForFork2_#t~ite12_Out-506856340| |P0Thread1of1ForFork2_#t~ite11_Out-506856340|)) (and (= |P0Thread1of1ForFork2_#t~ite12_Out-506856340| ~x$w_buff1~0_In-506856340) (= |P0Thread1of1ForFork2_#t~ite11_In-506856340| |P0Thread1of1ForFork2_#t~ite11_Out-506856340|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-506856340, ~x$w_buff1~0=~x$w_buff1~0_In-506856340, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-506856340, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-506856340, ~weak$$choice2~0=~weak$$choice2~0_In-506856340, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-506856340|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-506856340} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-506856340, ~x$w_buff1~0=~x$w_buff1~0_In-506856340, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-506856340, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-506856340, ~weak$$choice2~0=~weak$$choice2~0_In-506856340, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-506856340|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-506856340|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-506856340} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 12:55:21,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1321631587 256)))) (or (and (= ~x$w_buff0_used~0_In1321631587 |P0Thread1of1ForFork2_#t~ite15_Out1321631587|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In1321631587| |P0Thread1of1ForFork2_#t~ite14_Out1321631587|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1321631587 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1321631587 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In1321631587 256)) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1321631587 256))))) (= |P0Thread1of1ForFork2_#t~ite14_Out1321631587| |P0Thread1of1ForFork2_#t~ite15_Out1321631587|) .cse0 (= ~x$w_buff0_used~0_In1321631587 |P0Thread1of1ForFork2_#t~ite14_Out1321631587|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1321631587, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1321631587, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1321631587, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1321631587|, ~weak$$choice2~0=~weak$$choice2~0_In1321631587, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1321631587} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1321631587, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1321631587, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1321631587|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1321631587, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1321631587|, ~weak$$choice2~0=~weak$$choice2~0_In1321631587, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1321631587} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 12:55:21,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-371537585 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite18_Out-371537585| ~x$w_buff1_used~0_In-371537585) (= |P0Thread1of1ForFork2_#t~ite17_In-371537585| |P0Thread1of1ForFork2_#t~ite17_Out-371537585|)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite18_Out-371537585| |P0Thread1of1ForFork2_#t~ite17_Out-371537585|) (= ~x$w_buff1_used~0_In-371537585 |P0Thread1of1ForFork2_#t~ite17_Out-371537585|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-371537585 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-371537585 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In-371537585 256) 0)) (and (= (mod ~x$r_buff1_thd1~0_In-371537585 256) 0) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-371537585, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-371537585|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-371537585, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-371537585, ~weak$$choice2~0=~weak$$choice2~0_In-371537585, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-371537585} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-371537585, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-371537585|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-371537585|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-371537585, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-371537585, ~weak$$choice2~0=~weak$$choice2~0_In-371537585, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-371537585} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 12:55:21,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_33|) (= |v_P0Thread1of1ForFork2_#t~ite22_34| |v_P0Thread1of1ForFork2_#t~ite22_33|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= |v_P0Thread1of1ForFork2_#t~ite23_38| |v_P0Thread1of1ForFork2_#t~ite23_37|) (not (= 0 (mod v_~weak$$choice2~0_142 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_38|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_34|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_33|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_37|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_33|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 12:55:21,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 12:55:21,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1577997030 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1577997030 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1577997030 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1577997030 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-1577997030| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite35_Out-1577997030| ~x$w_buff1_used~0_In-1577997030)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1577997030, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1577997030, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1577997030, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1577997030} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1577997030|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1577997030, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1577997030, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1577997030, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1577997030} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 12:55:21,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-778828099 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-778828099 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-778828099|)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-778828099 |P2Thread1of1ForFork1_#t~ite36_Out-778828099|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-778828099, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-778828099} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-778828099|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-778828099, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-778828099} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 12:55:21,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In2061591043 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2061591043 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In2061591043 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In2061591043 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out2061591043| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite37_Out2061591043| ~x$r_buff1_thd3~0_In2061591043)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2061591043, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2061591043, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2061591043, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2061591043} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out2061591043|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2061591043, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2061591043, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2061591043, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2061591043} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:55:21,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_38|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 12:55:21,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:55:21,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1916082085 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1916082085 256)))) (or (and (= ~x$w_buff1~0_In1916082085 |ULTIMATE.start_main_#t~ite41_Out1916082085|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out1916082085| ~x~0_In1916082085) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1916082085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1916082085, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1916082085, ~x~0=~x~0_In1916082085} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1916082085|, ~x$w_buff1~0=~x$w_buff1~0_In1916082085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1916082085, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1916082085, ~x~0=~x~0_In1916082085} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 12:55:21,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 12:55:21,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-844217014 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-844217014 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-844217014| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-844217014| ~x$w_buff0_used~0_In-844217014)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-844217014, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-844217014} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-844217014, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-844217014|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-844217014} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 12:55:21,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1634917487 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1634917487 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1634917487 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1634917487 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-1634917487| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-1634917487 |ULTIMATE.start_main_#t~ite44_Out-1634917487|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1634917487, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1634917487, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1634917487, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1634917487} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1634917487, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1634917487, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1634917487, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1634917487|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1634917487} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:55:21,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1368212079 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1368212079 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1368212079|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1368212079 |ULTIMATE.start_main_#t~ite45_Out-1368212079|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1368212079, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1368212079} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1368212079, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1368212079|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1368212079} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 12:55:21,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In-982344571 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-982344571 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-982344571 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-982344571 256)))) (or (and (= ~x$r_buff1_thd0~0_In-982344571 |ULTIMATE.start_main_#t~ite46_Out-982344571|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite46_Out-982344571| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-982344571, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-982344571, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-982344571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-982344571} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-982344571, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-982344571|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-982344571, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-982344571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-982344571} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 12:55:21,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:55:21,129 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_113b003a-4c1a-4f1c-b89e-efec77df7cd7/bin/utaipan/witness.graphml [2019-12-07 12:55:21,129 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:55:21,130 INFO L168 Benchmark]: Toolchain (without parser) took 41951.25 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 939.8 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-12-07 12:55:21,130 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:55:21,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -136.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:55:21,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.24 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 12:55:21,131 INFO L168 Benchmark]: Boogie Preprocessor took 32.85 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 12:55:21,131 INFO L168 Benchmark]: RCFGBuilder took 391.83 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 12:55:21,132 INFO L168 Benchmark]: TraceAbstraction took 41028.11 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-12-07 12:55:21,132 INFO L168 Benchmark]: Witness Printer took 65.99 ms. Allocated memory is still 4.2 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:55:21,133 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 392.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -136.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.24 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 32.85 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 391.83 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 41028.11 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 65.99 ms. Allocated memory is still 4.2 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2360, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2361, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2362, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 40.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3111 SDtfs, 5310 SDslu, 11419 SDs, 0 SdLazy, 5485 SolverSat, 223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 18 SyntacticMatches, 16 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred 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: 16.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 115179 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 674 NumberOfCodeBlocks, 674 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 603 ConstructedInterpolants, 0 QuantifiedInterpolants, 134913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...