./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe008_power.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_08d9aa2c-f4a2-4acb-9b56-294ee1c50bdf/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_08d9aa2c-f4a2-4acb-9b56-294ee1c50bdf/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_08d9aa2c-f4a2-4acb-9b56-294ee1c50bdf/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_08d9aa2c-f4a2-4acb-9b56-294ee1c50bdf/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe008_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_08d9aa2c-f4a2-4acb-9b56-294ee1c50bdf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_08d9aa2c-f4a2-4acb-9b56-294ee1c50bdf/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 12b0a0d8072c4fd3ae9930be8c06779ae4e78e60 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 11:01:42,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:01:42,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:01:42,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:01:42,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:01:42,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:01:42,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:01:42,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:01:42,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:01:42,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:01:42,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:01:42,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:01:42,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:01:42,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:01:42,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:01:42,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:01:42,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:01:42,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:01:42,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:01:42,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:01:42,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:01:42,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:01:42,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:01:42,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:01:42,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:01:42,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:01:42,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:01:42,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:01:42,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:01:42,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:01:42,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:01:42,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:01:42,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:01:42,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:01:42,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:01:42,994 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:01:42,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:01:42,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:01:42,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:01:42,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:01:42,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:01:42,996 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_08d9aa2c-f4a2-4acb-9b56-294ee1c50bdf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:01:43,005 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:01:43,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:01:43,006 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:01:43,006 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:01:43,006 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:01:43,006 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:01:43,006 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:01:43,006 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:01:43,007 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:01:43,007 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:01:43,007 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:01:43,007 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:01:43,007 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:01:43,007 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:01:43,007 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:01:43,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:01:43,008 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:01:43,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:01:43,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:01:43,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:01:43,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:01:43,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:01:43,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:01:43,008 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:01:43,008 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:01:43,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:01:43,009 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:01:43,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:01:43,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:01:43,009 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:01:43,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:01:43,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:01:43,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:01:43,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:01:43,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:01:43,010 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:01:43,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:01:43,010 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:01:43,010 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:01:43,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:01:43,010 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_08d9aa2c-f4a2-4acb-9b56-294ee1c50bdf/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 -> 12b0a0d8072c4fd3ae9930be8c06779ae4e78e60 [2019-12-07 11:01:43,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:01:43,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:01:43,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:01:43,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:01:43,122 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:01:43,122 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_08d9aa2c-f4a2-4acb-9b56-294ee1c50bdf/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe008_power.opt.i [2019-12-07 11:01:43,169 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_08d9aa2c-f4a2-4acb-9b56-294ee1c50bdf/bin/utaipan/data/313c7cd22/553478afcc164dbfb661642a5c1575bf/FLAG070437086 [2019-12-07 11:01:43,608 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:01:43,608 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_08d9aa2c-f4a2-4acb-9b56-294ee1c50bdf/sv-benchmarks/c/pthread-wmm/safe008_power.opt.i [2019-12-07 11:01:43,620 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_08d9aa2c-f4a2-4acb-9b56-294ee1c50bdf/bin/utaipan/data/313c7cd22/553478afcc164dbfb661642a5c1575bf/FLAG070437086 [2019-12-07 11:01:43,955 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_08d9aa2c-f4a2-4acb-9b56-294ee1c50bdf/bin/utaipan/data/313c7cd22/553478afcc164dbfb661642a5c1575bf [2019-12-07 11:01:43,962 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:01:43,965 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:01:43,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:01:43,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:01:43,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:01:43,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:01:43" (1/1) ... [2019-12-07 11:01:43,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46581b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:43, skipping insertion in model container [2019-12-07 11:01:43,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:01:43" (1/1) ... [2019-12-07 11:01:43,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:01:44,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:01:44,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:01:44,276 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:01:44,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:01:44,366 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:01:44,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:44 WrapperNode [2019-12-07 11:01:44,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:01:44,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:01:44,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:01:44,367 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:01:44,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:44" (1/1) ... [2019-12-07 11:01:44,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:44" (1/1) ... [2019-12-07 11:01:44,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:01:44,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:01:44,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:01:44,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:01:44,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:44" (1/1) ... [2019-12-07 11:01:44,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:44" (1/1) ... [2019-12-07 11:01:44,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:44" (1/1) ... [2019-12-07 11:01:44,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:44" (1/1) ... [2019-12-07 11:01:44,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:44" (1/1) ... [2019-12-07 11:01:44,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:44" (1/1) ... [2019-12-07 11:01:44,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:44" (1/1) ... [2019-12-07 11:01:44,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:01:44,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:01:44,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:01:44,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:01:44,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08d9aa2c-f4a2-4acb-9b56-294ee1c50bdf/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 11:01:44,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:01:44,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:01:44,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:01:44,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:01:44,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:01:44,476 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:01:44,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:01:44,476 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:01:44,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:01:44,477 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:01:44,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:01:44,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 11:01:44,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:01:44,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:01:44,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:01:44,478 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 11:01:44,909 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:01:44,909 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:01:44,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:01:44 BoogieIcfgContainer [2019-12-07 11:01:44,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:01:44,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:01:44,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:01:44,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:01:44,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:01:43" (1/3) ... [2019-12-07 11:01:44,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55067f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:01:44, skipping insertion in model container [2019-12-07 11:01:44,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:44" (2/3) ... [2019-12-07 11:01:44,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55067f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:01:44, skipping insertion in model container [2019-12-07 11:01:44,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:01:44" (3/3) ... [2019-12-07 11:01:44,915 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_power.opt.i [2019-12-07 11:01:44,921 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:01:44,921 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:01:44,926 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:01:44,927 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:01:44,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,957 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,957 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,957 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,958 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,958 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,983 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,983 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:44,997 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 11:01:45,009 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:01:45,010 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:01:45,010 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:01:45,010 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:01:45,010 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:01:45,010 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:01:45,010 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:01:45,010 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:01:45,022 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 293 transitions [2019-12-07 11:01:45,023 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 235 places, 293 transitions [2019-12-07 11:01:45,099 INFO L134 PetriNetUnfolder]: 68/290 cut-off events. [2019-12-07 11:01:45,099 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:01:45,112 INFO L76 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 290 events. 68/290 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1262 event pairs. 9/229 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2019-12-07 11:01:45,139 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 235 places, 293 transitions [2019-12-07 11:01:45,187 INFO L134 PetriNetUnfolder]: 68/290 cut-off events. [2019-12-07 11:01:45,187 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:01:45,197 INFO L76 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 290 events. 68/290 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1262 event pairs. 9/229 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2019-12-07 11:01:45,227 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 31682 [2019-12-07 11:01:45,227 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:01:49,477 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 132 [2019-12-07 11:01:49,631 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-12-07 11:01:49,665 INFO L206 etLargeBlockEncoding]: Checked pairs total: 167242 [2019-12-07 11:01:49,665 INFO L214 etLargeBlockEncoding]: Total number of compositions: 175 [2019-12-07 11:01:49,667 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 118 places, 145 transitions [2019-12-07 11:02:30,288 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 215972 states. [2019-12-07 11:02:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 215972 states. [2019-12-07 11:02:30,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:02:30,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:30,294 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:02:30,295 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:30,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:30,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1275411, now seen corresponding path program 1 times [2019-12-07 11:02:30,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:02:30,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100197020] [2019-12-07 11:02:30,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:30,458 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 11:02:30,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100197020] [2019-12-07 11:02:30,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:30,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:02:30,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781875939] [2019-12-07 11:02:30,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:02:30,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:02:30,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:02:30,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:30,474 INFO L87 Difference]: Start difference. First operand 215972 states. Second operand 3 states. [2019-12-07 11:02:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:33,229 INFO L93 Difference]: Finished difference Result 214184 states and 960653 transitions. [2019-12-07 11:02:33,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:02:33,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 11:02:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:34,187 INFO L225 Difference]: With dead ends: 214184 [2019-12-07 11:02:34,187 INFO L226 Difference]: Without dead ends: 203875 [2019-12-07 11:02:34,188 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 11:02:41,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203875 states. [2019-12-07 11:02:44,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203875 to 203875. [2019-12-07 11:02:44,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203875 states. [2019-12-07 11:02:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203875 states to 203875 states and 914061 transitions. [2019-12-07 11:02:45,412 INFO L78 Accepts]: Start accepts. Automaton has 203875 states and 914061 transitions. Word has length 3 [2019-12-07 11:02:45,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:45,413 INFO L462 AbstractCegarLoop]: Abstraction has 203875 states and 914061 transitions. [2019-12-07 11:02:45,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:02:45,413 INFO L276 IsEmpty]: Start isEmpty. Operand 203875 states and 914061 transitions. [2019-12-07 11:02:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:02:45,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:45,421 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:45,421 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:45,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:45,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1080836217, now seen corresponding path program 1 times [2019-12-07 11:02:45,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:02:45,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105080636] [2019-12-07 11:02:45,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:45,491 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 11:02:45,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105080636] [2019-12-07 11:02:45,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:45,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:02:45,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131800181] [2019-12-07 11:02:45,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:02:45,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:02:45,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:02:45,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:02:45,493 INFO L87 Difference]: Start difference. First operand 203875 states and 914061 transitions. Second operand 4 states. [2019-12-07 11:02:47,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:47,294 INFO L93 Difference]: Finished difference Result 324533 states and 1382292 transitions. [2019-12-07 11:02:47,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:02:47,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 11:02:47,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:48,166 INFO L225 Difference]: With dead ends: 324533 [2019-12-07 11:02:48,166 INFO L226 Difference]: Without dead ends: 324484 [2019-12-07 11:02:48,167 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 11:03:00,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324484 states. [2019-12-07 11:03:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324484 to 303600. [2019-12-07 11:03:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303600 states. [2019-12-07 11:03:05,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303600 states to 303600 states and 1306247 transitions. [2019-12-07 11:03:05,565 INFO L78 Accepts]: Start accepts. Automaton has 303600 states and 1306247 transitions. Word has length 13 [2019-12-07 11:03:05,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:05,566 INFO L462 AbstractCegarLoop]: Abstraction has 303600 states and 1306247 transitions. [2019-12-07 11:03:05,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:03:05,566 INFO L276 IsEmpty]: Start isEmpty. Operand 303600 states and 1306247 transitions. [2019-12-07 11:03:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:03:05,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:05,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:05,569 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:05,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:05,570 INFO L82 PathProgramCache]: Analyzing trace with hash -204047335, now seen corresponding path program 1 times [2019-12-07 11:03:05,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:05,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607384149] [2019-12-07 11:03:05,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:03:05,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607384149] [2019-12-07 11:03:05,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:05,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:03:05,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040283388] [2019-12-07 11:03:05,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:03:05,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:05,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:03:05,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:03:05,637 INFO L87 Difference]: Start difference. First operand 303600 states and 1306247 transitions. Second operand 4 states. [2019-12-07 11:03:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:06,563 INFO L93 Difference]: Finished difference Result 76848 states and 273255 transitions. [2019-12-07 11:03:06,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:03:06,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 11:03:06,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:06,670 INFO L225 Difference]: With dead ends: 76848 [2019-12-07 11:03:06,670 INFO L226 Difference]: Without dead ends: 60146 [2019-12-07 11:03:06,670 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 11:03:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60146 states. [2019-12-07 11:03:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60146 to 60058. [2019-12-07 11:03:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60058 states. [2019-12-07 11:03:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60058 states to 60058 states and 204368 transitions. [2019-12-07 11:03:07,727 INFO L78 Accepts]: Start accepts. Automaton has 60058 states and 204368 transitions. Word has length 13 [2019-12-07 11:03:07,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:07,727 INFO L462 AbstractCegarLoop]: Abstraction has 60058 states and 204368 transitions. [2019-12-07 11:03:07,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:03:07,727 INFO L276 IsEmpty]: Start isEmpty. Operand 60058 states and 204368 transitions. [2019-12-07 11:03:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:03:07,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:07,729 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:07,730 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:07,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:07,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1318284014, now seen corresponding path program 1 times [2019-12-07 11:03:07,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:07,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765083500] [2019-12-07 11:03:07,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:03:07,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765083500] [2019-12-07 11:03:07,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:07,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:03:07,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507658559] [2019-12-07 11:03:07,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:03:07,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:07,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:03:07,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:03:07,766 INFO L87 Difference]: Start difference. First operand 60058 states and 204368 transitions. Second operand 3 states. [2019-12-07 11:03:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:08,032 INFO L93 Difference]: Finished difference Result 79543 states and 265746 transitions. [2019-12-07 11:03:08,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:03:08,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 11:03:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:08,165 INFO L225 Difference]: With dead ends: 79543 [2019-12-07 11:03:08,165 INFO L226 Difference]: Without dead ends: 79543 [2019-12-07 11:03:08,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:03:08,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79543 states. [2019-12-07 11:03:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79543 to 63769. [2019-12-07 11:03:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63769 states. [2019-12-07 11:03:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63769 states to 63769 states and 215729 transitions. [2019-12-07 11:03:09,411 INFO L78 Accepts]: Start accepts. Automaton has 63769 states and 215729 transitions. Word has length 14 [2019-12-07 11:03:09,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:09,411 INFO L462 AbstractCegarLoop]: Abstraction has 63769 states and 215729 transitions. [2019-12-07 11:03:09,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:03:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 63769 states and 215729 transitions. [2019-12-07 11:03:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:03:09,414 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:09,414 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:09,414 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:09,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:09,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1318089179, now seen corresponding path program 1 times [2019-12-07 11:03:09,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:09,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965257131] [2019-12-07 11:03:09,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:09,468 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 11:03:09,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965257131] [2019-12-07 11:03:09,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:09,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:03:09,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819962149] [2019-12-07 11:03:09,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:03:09,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:09,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:03:09,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:03:09,470 INFO L87 Difference]: Start difference. First operand 63769 states and 215729 transitions. Second operand 5 states. [2019-12-07 11:03:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:11,399 INFO L93 Difference]: Finished difference Result 94937 states and 312893 transitions. [2019-12-07 11:03:11,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:03:11,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 11:03:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:11,536 INFO L225 Difference]: With dead ends: 94937 [2019-12-07 11:03:11,536 INFO L226 Difference]: Without dead ends: 94937 [2019-12-07 11:03:11,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:03:11,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94937 states. [2019-12-07 11:03:12,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94937 to 76278. [2019-12-07 11:03:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76278 states. [2019-12-07 11:03:12,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76278 states to 76278 states and 255316 transitions. [2019-12-07 11:03:12,970 INFO L78 Accepts]: Start accepts. Automaton has 76278 states and 255316 transitions. Word has length 14 [2019-12-07 11:03:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:12,970 INFO L462 AbstractCegarLoop]: Abstraction has 76278 states and 255316 transitions. [2019-12-07 11:03:12,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:03:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 76278 states and 255316 transitions. [2019-12-07 11:03:12,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:03:12,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:12,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:12,973 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:12,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:12,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1503911735, now seen corresponding path program 1 times [2019-12-07 11:03:12,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:12,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585966523] [2019-12-07 11:03:12,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:13,024 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 11:03:13,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585966523] [2019-12-07 11:03:13,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:13,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:03:13,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142791389] [2019-12-07 11:03:13,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:03:13,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:13,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:03:13,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:03:13,025 INFO L87 Difference]: Start difference. First operand 76278 states and 255316 transitions. Second operand 5 states. [2019-12-07 11:03:13,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:13,547 INFO L93 Difference]: Finished difference Result 99352 states and 327389 transitions. [2019-12-07 11:03:13,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:03:13,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 11:03:13,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:13,718 INFO L225 Difference]: With dead ends: 99352 [2019-12-07 11:03:13,718 INFO L226 Difference]: Without dead ends: 99352 [2019-12-07 11:03:13,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:03:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99352 states. [2019-12-07 11:03:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99352 to 75198. [2019-12-07 11:03:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75198 states. [2019-12-07 11:03:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75198 states to 75198 states and 251986 transitions. [2019-12-07 11:03:15,308 INFO L78 Accepts]: Start accepts. Automaton has 75198 states and 251986 transitions. Word has length 14 [2019-12-07 11:03:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:15,308 INFO L462 AbstractCegarLoop]: Abstraction has 75198 states and 251986 transitions. [2019-12-07 11:03:15,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:03:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 75198 states and 251986 transitions. [2019-12-07 11:03:15,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:03:15,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:15,320 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 11:03:15,320 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:15,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:15,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1149721652, now seen corresponding path program 1 times [2019-12-07 11:03:15,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:15,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88801000] [2019-12-07 11:03:15,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:15,386 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 11:03:15,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88801000] [2019-12-07 11:03:15,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:15,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:03:15,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658425757] [2019-12-07 11:03:15,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:03:15,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:15,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:03:15,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:03:15,388 INFO L87 Difference]: Start difference. First operand 75198 states and 251986 transitions. Second operand 5 states. [2019-12-07 11:03:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:16,058 INFO L93 Difference]: Finished difference Result 98811 states and 323705 transitions. [2019-12-07 11:03:16,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:03:16,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 11:03:16,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:16,227 INFO L225 Difference]: With dead ends: 98811 [2019-12-07 11:03:16,227 INFO L226 Difference]: Without dead ends: 98755 [2019-12-07 11:03:16,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:03:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98755 states. [2019-12-07 11:03:17,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98755 to 75194. [2019-12-07 11:03:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75194 states. [2019-12-07 11:03:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75194 states to 75194 states and 251713 transitions. [2019-12-07 11:03:17,960 INFO L78 Accepts]: Start accepts. Automaton has 75194 states and 251713 transitions. Word has length 22 [2019-12-07 11:03:17,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:17,960 INFO L462 AbstractCegarLoop]: Abstraction has 75194 states and 251713 transitions. [2019-12-07 11:03:17,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:03:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 75194 states and 251713 transitions. [2019-12-07 11:03:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:03:17,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:17,971 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 11:03:17,971 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:17,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:17,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1319107416, now seen corresponding path program 1 times [2019-12-07 11:03:17,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:17,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193810843] [2019-12-07 11:03:17,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:18,120 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 11:03:18,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193810843] [2019-12-07 11:03:18,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:18,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:03:18,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167616351] [2019-12-07 11:03:18,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:03:18,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:18,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:03:18,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:03:18,121 INFO L87 Difference]: Start difference. First operand 75194 states and 251713 transitions. Second operand 9 states. [2019-12-07 11:03:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:19,559 INFO L93 Difference]: Finished difference Result 103613 states and 336850 transitions. [2019-12-07 11:03:19,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:03:19,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-07 11:03:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:19,733 INFO L225 Difference]: With dead ends: 103613 [2019-12-07 11:03:19,733 INFO L226 Difference]: Without dead ends: 103557 [2019-12-07 11:03:19,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:03:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103557 states. [2019-12-07 11:03:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103557 to 74355. [2019-12-07 11:03:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74355 states. [2019-12-07 11:03:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74355 states to 74355 states and 246780 transitions. [2019-12-07 11:03:21,249 INFO L78 Accepts]: Start accepts. Automaton has 74355 states and 246780 transitions. Word has length 22 [2019-12-07 11:03:21,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:21,249 INFO L462 AbstractCegarLoop]: Abstraction has 74355 states and 246780 transitions. [2019-12-07 11:03:21,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:03:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 74355 states and 246780 transitions. [2019-12-07 11:03:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:03:21,268 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:21,268 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 11:03:21,268 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:21,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1797562704, now seen corresponding path program 1 times [2019-12-07 11:03:21,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:21,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973548835] [2019-12-07 11:03:21,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:21,323 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 11:03:21,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973548835] [2019-12-07 11:03:21,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:21,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:03:21,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342431087] [2019-12-07 11:03:21,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:03:21,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:21,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:03:21,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:03:21,324 INFO L87 Difference]: Start difference. First operand 74355 states and 246780 transitions. Second operand 5 states. [2019-12-07 11:03:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:22,020 INFO L93 Difference]: Finished difference Result 107522 states and 348630 transitions. [2019-12-07 11:03:22,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:03:22,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 11:03:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:22,330 INFO L225 Difference]: With dead ends: 107522 [2019-12-07 11:03:22,330 INFO L226 Difference]: Without dead ends: 107509 [2019-12-07 11:03:22,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:03:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107509 states. [2019-12-07 11:03:23,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107509 to 88878. [2019-12-07 11:03:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88878 states. [2019-12-07 11:03:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88878 states to 88878 states and 292210 transitions. [2019-12-07 11:03:23,931 INFO L78 Accepts]: Start accepts. Automaton has 88878 states and 292210 transitions. Word has length 25 [2019-12-07 11:03:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:23,932 INFO L462 AbstractCegarLoop]: Abstraction has 88878 states and 292210 transitions. [2019-12-07 11:03:23,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:03:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 88878 states and 292210 transitions. [2019-12-07 11:03:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:03:23,952 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:23,952 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 11:03:23,952 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:23,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:23,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2104474958, now seen corresponding path program 1 times [2019-12-07 11:03:23,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:23,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754087808] [2019-12-07 11:03:23,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:24,026 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 11:03:24,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754087808] [2019-12-07 11:03:24,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:24,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:03:24,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263544251] [2019-12-07 11:03:24,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:03:24,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:24,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:03:24,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:03:24,027 INFO L87 Difference]: Start difference. First operand 88878 states and 292210 transitions. Second operand 6 states. [2019-12-07 11:03:24,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:24,682 INFO L93 Difference]: Finished difference Result 119237 states and 385382 transitions. [2019-12-07 11:03:24,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:03:24,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 11:03:24,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:24,878 INFO L225 Difference]: With dead ends: 119237 [2019-12-07 11:03:24,878 INFO L226 Difference]: Without dead ends: 119037 [2019-12-07 11:03:24,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:03:25,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119037 states. [2019-12-07 11:03:26,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119037 to 96202. [2019-12-07 11:03:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96202 states. [2019-12-07 11:03:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96202 states to 96202 states and 314809 transitions. [2019-12-07 11:03:26,789 INFO L78 Accepts]: Start accepts. Automaton has 96202 states and 314809 transitions. Word has length 25 [2019-12-07 11:03:26,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:26,789 INFO L462 AbstractCegarLoop]: Abstraction has 96202 states and 314809 transitions. [2019-12-07 11:03:26,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:03:26,789 INFO L276 IsEmpty]: Start isEmpty. Operand 96202 states and 314809 transitions. [2019-12-07 11:03:26,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:03:26,812 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:26,812 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 11:03:26,812 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:26,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:26,812 INFO L82 PathProgramCache]: Analyzing trace with hash 728629617, now seen corresponding path program 1 times [2019-12-07 11:03:26,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:26,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171124066] [2019-12-07 11:03:26,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:26,831 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 11:03:26,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171124066] [2019-12-07 11:03:26,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:26,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:03:26,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453555717] [2019-12-07 11:03:26,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:03:26,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:26,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:03:26,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:03:26,832 INFO L87 Difference]: Start difference. First operand 96202 states and 314809 transitions. Second operand 3 states. [2019-12-07 11:03:27,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:27,173 INFO L93 Difference]: Finished difference Result 113628 states and 363323 transitions. [2019-12-07 11:03:27,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:03:27,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 11:03:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:27,356 INFO L225 Difference]: With dead ends: 113628 [2019-12-07 11:03:27,356 INFO L226 Difference]: Without dead ends: 113628 [2019-12-07 11:03:27,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:03:27,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113628 states. [2019-12-07 11:03:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113628 to 95081. [2019-12-07 11:03:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95081 states. [2019-12-07 11:03:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95081 states to 95081 states and 305341 transitions. [2019-12-07 11:03:29,272 INFO L78 Accepts]: Start accepts. Automaton has 95081 states and 305341 transitions. Word has length 25 [2019-12-07 11:03:29,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:29,272 INFO L462 AbstractCegarLoop]: Abstraction has 95081 states and 305341 transitions. [2019-12-07 11:03:29,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:03:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand 95081 states and 305341 transitions. [2019-12-07 11:03:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:03:29,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:29,294 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] [2019-12-07 11:03:29,294 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:29,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:29,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1761884185, now seen corresponding path program 1 times [2019-12-07 11:03:29,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:29,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497469346] [2019-12-07 11:03:29,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:29,354 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 11:03:29,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497469346] [2019-12-07 11:03:29,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:29,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:03:29,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351441677] [2019-12-07 11:03:29,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:03:29,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:29,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:03:29,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:03:29,355 INFO L87 Difference]: Start difference. First operand 95081 states and 305341 transitions. Second operand 5 states. [2019-12-07 11:03:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:30,099 INFO L93 Difference]: Finished difference Result 140311 states and 451557 transitions. [2019-12-07 11:03:30,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:03:30,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 11:03:30,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:30,326 INFO L225 Difference]: With dead ends: 140311 [2019-12-07 11:03:30,326 INFO L226 Difference]: Without dead ends: 140063 [2019-12-07 11:03:30,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 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 11:03:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140063 states. [2019-12-07 11:03:32,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140063 to 97133. [2019-12-07 11:03:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97133 states. [2019-12-07 11:03:32,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97133 states to 97133 states and 312789 transitions. [2019-12-07 11:03:32,328 INFO L78 Accepts]: Start accepts. Automaton has 97133 states and 312789 transitions. Word has length 26 [2019-12-07 11:03:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:32,329 INFO L462 AbstractCegarLoop]: Abstraction has 97133 states and 312789 transitions. [2019-12-07 11:03:32,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:03:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 97133 states and 312789 transitions. [2019-12-07 11:03:32,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:03:32,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:32,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:32,566 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:32,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:32,566 INFO L82 PathProgramCache]: Analyzing trace with hash 642431426, now seen corresponding path program 1 times [2019-12-07 11:03:32,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:32,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897173025] [2019-12-07 11:03:32,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:32,607 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 11:03:32,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897173025] [2019-12-07 11:03:32,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:32,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:03:32,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169678972] [2019-12-07 11:03:32,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:03:32,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:32,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:03:32,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:03:32,608 INFO L87 Difference]: Start difference. First operand 97133 states and 312789 transitions. Second operand 5 states. [2019-12-07 11:03:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:33,453 INFO L93 Difference]: Finished difference Result 132763 states and 421535 transitions. [2019-12-07 11:03:33,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:03:33,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 11:03:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:33,668 INFO L225 Difference]: With dead ends: 132763 [2019-12-07 11:03:33,668 INFO L226 Difference]: Without dead ends: 132763 [2019-12-07 11:03:33,668 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 11:03:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132763 states. [2019-12-07 11:03:35,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132763 to 112738. [2019-12-07 11:03:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112738 states. [2019-12-07 11:03:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112738 states to 112738 states and 362094 transitions. [2019-12-07 11:03:35,766 INFO L78 Accepts]: Start accepts. Automaton has 112738 states and 362094 transitions. Word has length 30 [2019-12-07 11:03:35,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:35,766 INFO L462 AbstractCegarLoop]: Abstraction has 112738 states and 362094 transitions. [2019-12-07 11:03:35,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:03:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand 112738 states and 362094 transitions. [2019-12-07 11:03:35,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 11:03:35,813 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:35,813 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:35,813 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:35,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:35,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1693722372, now seen corresponding path program 1 times [2019-12-07 11:03:35,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:35,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416270268] [2019-12-07 11:03:35,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:35,850 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 11:03:35,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416270268] [2019-12-07 11:03:35,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:35,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:03:35,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541550403] [2019-12-07 11:03:35,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:03:35,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:35,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:03:35,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:03:35,851 INFO L87 Difference]: Start difference. First operand 112738 states and 362094 transitions. Second operand 4 states. [2019-12-07 11:03:36,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:36,214 INFO L93 Difference]: Finished difference Result 113927 states and 364577 transitions. [2019-12-07 11:03:36,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:03:36,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-07 11:03:36,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:36,398 INFO L225 Difference]: With dead ends: 113927 [2019-12-07 11:03:36,398 INFO L226 Difference]: Without dead ends: 112530 [2019-12-07 11:03:36,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:03:37,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112530 states. [2019-12-07 11:03:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112530 to 112530. [2019-12-07 11:03:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112530 states. [2019-12-07 11:03:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112530 states to 112530 states and 361284 transitions. [2019-12-07 11:03:38,374 INFO L78 Accepts]: Start accepts. Automaton has 112530 states and 361284 transitions. Word has length 31 [2019-12-07 11:03:38,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:38,374 INFO L462 AbstractCegarLoop]: Abstraction has 112530 states and 361284 transitions. [2019-12-07 11:03:38,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:03:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 112530 states and 361284 transitions. [2019-12-07 11:03:38,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 11:03:38,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:38,422 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] [2019-12-07 11:03:38,423 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:38,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:38,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1582539924, now seen corresponding path program 1 times [2019-12-07 11:03:38,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:38,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333960052] [2019-12-07 11:03:38,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:38,475 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 11:03:38,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333960052] [2019-12-07 11:03:38,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:38,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:03:38,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351223635] [2019-12-07 11:03:38,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:03:38,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:38,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:03:38,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:03:38,476 INFO L87 Difference]: Start difference. First operand 112530 states and 361284 transitions. Second operand 5 states. [2019-12-07 11:03:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:38,643 INFO L93 Difference]: Finished difference Result 53486 states and 161171 transitions. [2019-12-07 11:03:38,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:03:38,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-07 11:03:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:38,699 INFO L225 Difference]: With dead ends: 53486 [2019-12-07 11:03:38,699 INFO L226 Difference]: Without dead ends: 47036 [2019-12-07 11:03:38,699 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 11:03:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47036 states. [2019-12-07 11:03:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47036 to 43331. [2019-12-07 11:03:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43331 states. [2019-12-07 11:03:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43331 states to 43331 states and 130527 transitions. [2019-12-07 11:03:39,320 INFO L78 Accepts]: Start accepts. Automaton has 43331 states and 130527 transitions. Word has length 32 [2019-12-07 11:03:39,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:39,320 INFO L462 AbstractCegarLoop]: Abstraction has 43331 states and 130527 transitions. [2019-12-07 11:03:39,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:03:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 43331 states and 130527 transitions. [2019-12-07 11:03:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:03:39,353 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:39,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:39,353 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:39,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:39,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1282662367, now seen corresponding path program 1 times [2019-12-07 11:03:39,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:39,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090845479] [2019-12-07 11:03:39,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:39,427 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 11:03:39,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090845479] [2019-12-07 11:03:39,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:39,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:03:39,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432481873] [2019-12-07 11:03:39,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:03:39,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:39,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:03:39,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:03:39,428 INFO L87 Difference]: Start difference. First operand 43331 states and 130527 transitions. Second operand 6 states. [2019-12-07 11:03:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:39,967 INFO L93 Difference]: Finished difference Result 53050 states and 157834 transitions. [2019-12-07 11:03:39,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:03:39,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 11:03:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:40,034 INFO L225 Difference]: With dead ends: 53050 [2019-12-07 11:03:40,035 INFO L226 Difference]: Without dead ends: 52674 [2019-12-07 11:03:40,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:03:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52674 states. [2019-12-07 11:03:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52674 to 44357. [2019-12-07 11:03:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44357 states. [2019-12-07 11:03:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44357 states to 44357 states and 133570 transitions. [2019-12-07 11:03:40,768 INFO L78 Accepts]: Start accepts. Automaton has 44357 states and 133570 transitions. Word has length 33 [2019-12-07 11:03:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:40,768 INFO L462 AbstractCegarLoop]: Abstraction has 44357 states and 133570 transitions. [2019-12-07 11:03:40,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:03:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 44357 states and 133570 transitions. [2019-12-07 11:03:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:03:40,802 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:40,802 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:40,802 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:40,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:40,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1175801098, now seen corresponding path program 1 times [2019-12-07 11:03:40,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:40,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596296803] [2019-12-07 11:03:40,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:40,872 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 11:03:40,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596296803] [2019-12-07 11:03:40,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:40,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:03:40,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826800431] [2019-12-07 11:03:40,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:03:40,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:40,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:03:40,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:03:40,873 INFO L87 Difference]: Start difference. First operand 44357 states and 133570 transitions. Second operand 6 states. [2019-12-07 11:03:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:41,595 INFO L93 Difference]: Finished difference Result 66954 states and 199253 transitions. [2019-12-07 11:03:41,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:03:41,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 11:03:41,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:41,677 INFO L225 Difference]: With dead ends: 66954 [2019-12-07 11:03:41,677 INFO L226 Difference]: Without dead ends: 66708 [2019-12-07 11:03:41,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:03:41,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66708 states. [2019-12-07 11:03:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66708 to 44141. [2019-12-07 11:03:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44141 states. [2019-12-07 11:03:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44141 states to 44141 states and 132903 transitions. [2019-12-07 11:03:42,484 INFO L78 Accepts]: Start accepts. Automaton has 44141 states and 132903 transitions. Word has length 34 [2019-12-07 11:03:42,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:42,485 INFO L462 AbstractCegarLoop]: Abstraction has 44141 states and 132903 transitions. [2019-12-07 11:03:42,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:03:42,485 INFO L276 IsEmpty]: Start isEmpty. Operand 44141 states and 132903 transitions. [2019-12-07 11:03:42,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:03:42,518 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:42,518 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:42,518 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:42,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:42,519 INFO L82 PathProgramCache]: Analyzing trace with hash -276856144, now seen corresponding path program 2 times [2019-12-07 11:03:42,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:42,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172833617] [2019-12-07 11:03:42,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:42,590 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 11:03:42,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172833617] [2019-12-07 11:03:42,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:42,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:03:42,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542382240] [2019-12-07 11:03:42,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:03:42,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:42,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:03:42,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:03:42,591 INFO L87 Difference]: Start difference. First operand 44141 states and 132903 transitions. Second operand 7 states. [2019-12-07 11:03:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:44,098 INFO L93 Difference]: Finished difference Result 97886 states and 291218 transitions. [2019-12-07 11:03:44,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 11:03:44,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-07 11:03:44,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:44,225 INFO L225 Difference]: With dead ends: 97886 [2019-12-07 11:03:44,226 INFO L226 Difference]: Without dead ends: 97742 [2019-12-07 11:03:44,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:03:44,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97742 states. [2019-12-07 11:03:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97742 to 43361. [2019-12-07 11:03:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43361 states. [2019-12-07 11:03:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43361 states to 43361 states and 130638 transitions. [2019-12-07 11:03:45,290 INFO L78 Accepts]: Start accepts. Automaton has 43361 states and 130638 transitions. Word has length 34 [2019-12-07 11:03:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:45,290 INFO L462 AbstractCegarLoop]: Abstraction has 43361 states and 130638 transitions. [2019-12-07 11:03:45,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:03:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 43361 states and 130638 transitions. [2019-12-07 11:03:45,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:03:45,410 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:45,410 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:45,410 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:45,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:45,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1049017354, now seen corresponding path program 3 times [2019-12-07 11:03:45,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:45,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719621332] [2019-12-07 11:03:45,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:45,476 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 11:03:45,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719621332] [2019-12-07 11:03:45,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:45,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:03:45,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492596952] [2019-12-07 11:03:45,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:03:45,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:45,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:03:45,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:03:45,477 INFO L87 Difference]: Start difference. First operand 43361 states and 130638 transitions. Second operand 6 states. [2019-12-07 11:03:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:46,687 INFO L93 Difference]: Finished difference Result 62871 states and 185906 transitions. [2019-12-07 11:03:46,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:03:46,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 11:03:46,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:46,767 INFO L225 Difference]: With dead ends: 62871 [2019-12-07 11:03:46,767 INFO L226 Difference]: Without dead ends: 62680 [2019-12-07 11:03:46,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:03:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62680 states. [2019-12-07 11:03:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62680 to 42516. [2019-12-07 11:03:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42516 states. [2019-12-07 11:03:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42516 states to 42516 states and 128036 transitions. [2019-12-07 11:03:47,551 INFO L78 Accepts]: Start accepts. Automaton has 42516 states and 128036 transitions. Word has length 34 [2019-12-07 11:03:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:47,552 INFO L462 AbstractCegarLoop]: Abstraction has 42516 states and 128036 transitions. [2019-12-07 11:03:47,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:03:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 42516 states and 128036 transitions. [2019-12-07 11:03:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:03:47,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:47,590 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:47,590 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:47,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:47,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1110060489, now seen corresponding path program 1 times [2019-12-07 11:03:47,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:47,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905066453] [2019-12-07 11:03:47,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:47,682 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 11:03:47,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905066453] [2019-12-07 11:03:47,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:47,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:03:47,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592545023] [2019-12-07 11:03:47,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:03:47,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:47,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:03:47,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:03:47,683 INFO L87 Difference]: Start difference. First operand 42516 states and 128036 transitions. Second operand 8 states. [2019-12-07 11:03:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:49,494 INFO L93 Difference]: Finished difference Result 82510 states and 242687 transitions. [2019-12-07 11:03:49,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 11:03:49,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-12-07 11:03:49,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:49,599 INFO L225 Difference]: With dead ends: 82510 [2019-12-07 11:03:49,599 INFO L226 Difference]: Without dead ends: 82510 [2019-12-07 11:03:49,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2019-12-07 11:03:49,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82510 states. [2019-12-07 11:03:50,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82510 to 50700. [2019-12-07 11:03:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50700 states. [2019-12-07 11:03:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50700 states to 50700 states and 152226 transitions. [2019-12-07 11:03:50,645 INFO L78 Accepts]: Start accepts. Automaton has 50700 states and 152226 transitions. Word has length 42 [2019-12-07 11:03:50,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:50,645 INFO L462 AbstractCegarLoop]: Abstraction has 50700 states and 152226 transitions. [2019-12-07 11:03:50,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:03:50,645 INFO L276 IsEmpty]: Start isEmpty. Operand 50700 states and 152226 transitions. [2019-12-07 11:03:50,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:03:50,692 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:50,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:50,692 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:50,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:50,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1499057353, now seen corresponding path program 2 times [2019-12-07 11:03:50,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:50,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528252420] [2019-12-07 11:03:50,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:50,750 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 11:03:50,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528252420] [2019-12-07 11:03:50,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:50,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:03:50,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173174477] [2019-12-07 11:03:50,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:03:50,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:50,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:03:50,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:03:50,751 INFO L87 Difference]: Start difference. First operand 50700 states and 152226 transitions. Second operand 6 states. [2019-12-07 11:03:50,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:50,901 INFO L93 Difference]: Finished difference Result 47807 states and 145212 transitions. [2019-12-07 11:03:50,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:03:50,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 11:03:50,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:50,959 INFO L225 Difference]: With dead ends: 47807 [2019-12-07 11:03:50,959 INFO L226 Difference]: Without dead ends: 47402 [2019-12-07 11:03:50,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:03:51,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47402 states. [2019-12-07 11:03:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47402 to 43097. [2019-12-07 11:03:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43097 states. [2019-12-07 11:03:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43097 states to 43097 states and 132456 transitions. [2019-12-07 11:03:51,658 INFO L78 Accepts]: Start accepts. Automaton has 43097 states and 132456 transitions. Word has length 42 [2019-12-07 11:03:51,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:51,658 INFO L462 AbstractCegarLoop]: Abstraction has 43097 states and 132456 transitions. [2019-12-07 11:03:51,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:03:51,658 INFO L276 IsEmpty]: Start isEmpty. Operand 43097 states and 132456 transitions. [2019-12-07 11:03:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:03:51,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:51,700 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:51,700 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:51,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:51,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1171224277, now seen corresponding path program 1 times [2019-12-07 11:03:51,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:51,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413364928] [2019-12-07 11:03:51,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:51,736 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 11:03:51,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413364928] [2019-12-07 11:03:51,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:51,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:03:51,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940084502] [2019-12-07 11:03:51,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:03:51,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:51,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:03:51,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:03:51,737 INFO L87 Difference]: Start difference. First operand 43097 states and 132456 transitions. Second operand 3 states. [2019-12-07 11:03:51,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:51,900 INFO L93 Difference]: Finished difference Result 49734 states and 150147 transitions. [2019-12-07 11:03:51,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:03:51,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 11:03:51,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:51,966 INFO L225 Difference]: With dead ends: 49734 [2019-12-07 11:03:51,966 INFO L226 Difference]: Without dead ends: 49734 [2019-12-07 11:03:51,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:03:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49734 states. [2019-12-07 11:03:52,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49734 to 42810. [2019-12-07 11:03:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42810 states. [2019-12-07 11:03:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42810 states to 42810 states and 129725 transitions. [2019-12-07 11:03:52,664 INFO L78 Accepts]: Start accepts. Automaton has 42810 states and 129725 transitions. Word has length 67 [2019-12-07 11:03:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:52,664 INFO L462 AbstractCegarLoop]: Abstraction has 42810 states and 129725 transitions. [2019-12-07 11:03:52,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:03:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 42810 states and 129725 transitions. [2019-12-07 11:03:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 11:03:52,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:52,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:52,706 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:52,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:52,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1892526820, now seen corresponding path program 1 times [2019-12-07 11:03:52,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:52,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279584609] [2019-12-07 11:03:52,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:52,751 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 11:03:52,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279584609] [2019-12-07 11:03:52,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:52,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:03:52,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760366853] [2019-12-07 11:03:52,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:03:52,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:52,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:03:52,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:03:52,752 INFO L87 Difference]: Start difference. First operand 42810 states and 129725 transitions. Second operand 5 states. [2019-12-07 11:03:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:52,882 INFO L93 Difference]: Finished difference Result 48633 states and 146543 transitions. [2019-12-07 11:03:52,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:03:52,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-07 11:03:52,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:52,893 INFO L225 Difference]: With dead ends: 48633 [2019-12-07 11:03:52,893 INFO L226 Difference]: Without dead ends: 11565 [2019-12-07 11:03:52,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:03:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11565 states. [2019-12-07 11:03:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11565 to 11538. [2019-12-07 11:03:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11538 states. [2019-12-07 11:03:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11538 states to 11538 states and 32978 transitions. [2019-12-07 11:03:53,033 INFO L78 Accepts]: Start accepts. Automaton has 11538 states and 32978 transitions. Word has length 68 [2019-12-07 11:03:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:53,034 INFO L462 AbstractCegarLoop]: Abstraction has 11538 states and 32978 transitions. [2019-12-07 11:03:53,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:03:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 11538 states and 32978 transitions. [2019-12-07 11:03:53,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 11:03:53,043 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:53,043 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:53,043 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:53,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:53,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1417116384, now seen corresponding path program 2 times [2019-12-07 11:03:53,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:53,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459758704] [2019-12-07 11:03:53,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:53,077 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 11:03:53,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459758704] [2019-12-07 11:03:53,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:53,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:03:53,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738349735] [2019-12-07 11:03:53,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:03:53,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:53,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:03:53,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:03:53,079 INFO L87 Difference]: Start difference. First operand 11538 states and 32978 transitions. Second operand 3 states. [2019-12-07 11:03:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:53,113 INFO L93 Difference]: Finished difference Result 11537 states and 32976 transitions. [2019-12-07 11:03:53,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:03:53,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-07 11:03:53,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:53,123 INFO L225 Difference]: With dead ends: 11537 [2019-12-07 11:03:53,124 INFO L226 Difference]: Without dead ends: 11537 [2019-12-07 11:03:53,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:03:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11537 states. [2019-12-07 11:03:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11537 to 11537. [2019-12-07 11:03:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11537 states. [2019-12-07 11:03:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11537 states to 11537 states and 32976 transitions. [2019-12-07 11:03:53,257 INFO L78 Accepts]: Start accepts. Automaton has 11537 states and 32976 transitions. Word has length 68 [2019-12-07 11:03:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:53,257 INFO L462 AbstractCegarLoop]: Abstraction has 11537 states and 32976 transitions. [2019-12-07 11:03:53,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:03:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 11537 states and 32976 transitions. [2019-12-07 11:03:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 11:03:53,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:53,266 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:53,266 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:53,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:53,266 INFO L82 PathProgramCache]: Analyzing trace with hash 968070735, now seen corresponding path program 1 times [2019-12-07 11:03:53,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:53,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714496006] [2019-12-07 11:03:53,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:53,308 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 11:03:53,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714496006] [2019-12-07 11:03:53,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:53,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:03:53,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668163765] [2019-12-07 11:03:53,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:03:53,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:53,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:03:53,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:03:53,310 INFO L87 Difference]: Start difference. First operand 11537 states and 32976 transitions. Second operand 3 states. [2019-12-07 11:03:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:53,347 INFO L93 Difference]: Finished difference Result 11537 states and 32975 transitions. [2019-12-07 11:03:53,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:03:53,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-07 11:03:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:53,362 INFO L225 Difference]: With dead ends: 11537 [2019-12-07 11:03:53,362 INFO L226 Difference]: Without dead ends: 11537 [2019-12-07 11:03:53,362 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 11:03:53,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11537 states. [2019-12-07 11:03:53,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11537 to 7235. [2019-12-07 11:03:53,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7235 states. [2019-12-07 11:03:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7235 states to 7235 states and 20759 transitions. [2019-12-07 11:03:53,483 INFO L78 Accepts]: Start accepts. Automaton has 7235 states and 20759 transitions. Word has length 69 [2019-12-07 11:03:53,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:53,483 INFO L462 AbstractCegarLoop]: Abstraction has 7235 states and 20759 transitions. [2019-12-07 11:03:53,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:03:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 7235 states and 20759 transitions. [2019-12-07 11:03:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 11:03:53,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:53,489 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:53,489 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:53,489 INFO L82 PathProgramCache]: Analyzing trace with hash -163624531, now seen corresponding path program 1 times [2019-12-07 11:03:53,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:53,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942080685] [2019-12-07 11:03:53,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:53,551 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 11:03:53,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942080685] [2019-12-07 11:03:53,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:53,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:03:53,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9596137] [2019-12-07 11:03:53,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:03:53,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:53,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:03:53,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:03:53,552 INFO L87 Difference]: Start difference. First operand 7235 states and 20759 transitions. Second operand 5 states. [2019-12-07 11:03:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:53,603 INFO L93 Difference]: Finished difference Result 9654 states and 27709 transitions. [2019-12-07 11:03:53,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:03:53,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-07 11:03:53,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:53,605 INFO L225 Difference]: With dead ends: 9654 [2019-12-07 11:03:53,606 INFO L226 Difference]: Without dead ends: 2934 [2019-12-07 11:03:53,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:03:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2019-12-07 11:03:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2934. [2019-12-07 11:03:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2934 states. [2019-12-07 11:03:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 8300 transitions. [2019-12-07 11:03:53,640 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 8300 transitions. Word has length 70 [2019-12-07 11:03:53,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:53,640 INFO L462 AbstractCegarLoop]: Abstraction has 2934 states and 8300 transitions. [2019-12-07 11:03:53,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:03:53,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 8300 transitions. [2019-12-07 11:03:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 11:03:53,642 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:53,642 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:53,642 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:53,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:53,642 INFO L82 PathProgramCache]: Analyzing trace with hash -711143795, now seen corresponding path program 2 times [2019-12-07 11:03:53,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:53,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392590292] [2019-12-07 11:03:53,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:03:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:03:53,751 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:03:53,751 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:03:53,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse1 (store |v_#valid_66| 0 0))) (let ((.cse0 (store .cse1 |v_~#x~0.base_152| 1))) (and (= 0 v_~x$w_buff1~0_233) (= v_~__unbuffered_p1_EAX$r_buff1_thd2~0_7 0) (= 0 v_~weak$$choice0~0_156) (= 0 v_~x$r_buff1_thd3~0_230) (= (store .cse0 |v_ULTIMATE.start_main_~#t1964~0.base_24| 1) |v_#valid_64|) (= v_~__unbuffered_p1_EAX$r_buff0_thd3~0_5 0) (= |v_#length_30| (store (store |v_#length_31| |v_~#x~0.base_152| 4) |v_ULTIMATE.start_main_~#t1964~0.base_24| 4)) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_46 0) (= v_~x$r_buff0_thd0~0_121 0) (= 0 v_~weak$$choice1~0_85) (= v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8 0) (= |v_#memory_int_278| (store |v_#memory_int_279| |v_ULTIMATE.start_main_~#t1964~0.base_24| (store (select |v_#memory_int_279| |v_ULTIMATE.start_main_~#t1964~0.base_24|) |v_ULTIMATE.start_main_~#t1964~0.offset_19| 0))) (= 0 v_~x$r_buff0_thd2~0_544) (= v_~__unbuffered_p1_EAX$read_delayed~0_56 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1964~0.base_24|)) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1964~0.base_24|) (= 0 v_~x$read_delayed~0_8) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed_var~0.offset_8) (= v_~__unbuffered_p1_EAX$w_buff1_used~0_8 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_46 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8 0) (= v_~__unbuffered_cnt~0_122 0) (= v_~main$tmp_guard1~0_23 0) (= v_~x$r_buff1_thd0~0_248 0) (= v_~__unbuffered_p1_EAX$w_buff0~0_8 0) (= 0 v_~x$w_buff0~0_313) (= v_~main$tmp_guard0~0_32 0) (= v_~x$w_buff0_used~0_1098 0) (= v_~y~0_37 0) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EAX$r_buff0_thd1~0_8 0) (= (select .cse1 |v_~#x~0.base_152|) 0) (= 0 v_~weak$$choice2~0_80) (= (select (select |v_#memory_int_279| |v_~#x~0.base_152|) |v_~#x~0.offset_152|) 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7 0) (= v_~__unbuffered_p1_EAX$w_buff1~0_8 0) (= 0 |v_ULTIMATE.start_main_~#t1964~0.offset_19|) (< 0 |v_#StackHeapBarrier_19|) (= v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8 0) (= v_~__unbuffered_p1_EAX$flush_delayed~0_8 0) (= 0 v_~x$read_delayed_var~0.base_8) (< |v_#StackHeapBarrier_19| |v_~#x~0.base_152|) (= v_~z~0_125 0) (= 0 v_~x$r_buff1_thd2~0_577) (= v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8 0) (= 0 |v_~#x~0.offset_152|) (= 0 v_~__unbuffered_p1_EAX~0_67) (= v_~x$r_buff1_thd1~0_213 0) (= v_~__unbuffered_p1_EAX$w_buff0_used~0_7 0) (= v_~x$mem_tmp~0_18 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$w_buff1_used~0_667) (= 0 v_~x$r_buff0_thd3~0_135) (= v_~x$r_buff0_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_38) (= 0 v_~__unbuffered_p1_EAX$mem_tmp~0_8)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_279|, #length=|v_#length_31|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_313, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_9|, ~__unbuffered_p1_EAX$r_buff0_thd0~0=v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX$r_buff1_thd2~0=v_~__unbuffered_p1_EAX$r_buff1_thd2~0_7, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_213, ULTIMATE.start_main_~#t1966~0.base=|v_ULTIMATE.start_main_~#t1966~0.base_21|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_135, ~weak$$choice1~0=v_~weak$$choice1~0_85, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ~__unbuffered_p1_EAX$w_buff0~0=v_~__unbuffered_p1_EAX$w_buff0~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_46, #length=|v_#length_30|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ULTIMATE.start_main_~#t1964~0.offset=|v_ULTIMATE.start_main_~#t1964~0.offset_19|, ULTIMATE.start_main_~#t1964~0.base=|v_ULTIMATE.start_main_~#t1964~0.base_24|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_121, ~__unbuffered_p1_EAX$r_buff0_thd1~0=v_~__unbuffered_p1_EAX$r_buff0_thd1~0_8, ~#x~0.offset=|v_~#x~0.offset_152|, ~x$w_buff1~0=v_~x$w_buff1~0_233, ~__unbuffered_p1_EAX$r_buff1_thd3~0=v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_667, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_577, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_73|, ULTIMATE.start_main_~#t1965~0.offset=|v_ULTIMATE.start_main_~#t1965~0.offset_17|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_29|, ULTIMATE.start_main_#t~nondet83=|v_ULTIMATE.start_main_#t~nondet83_91|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_156, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_105|, ~__unbuffered_p1_EAX$w_buff1_used~0=v_~__unbuffered_p1_EAX$w_buff1_used~0_8, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_83|, ~__unbuffered_p1_EAX$w_buff1~0=v_~__unbuffered_p1_EAX$w_buff1~0_8, ULTIMATE.start_main_~#t1966~0.offset=|v_ULTIMATE.start_main_~#t1966~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122, ~__unbuffered_p1_EAX$r_buff0_thd2~0=v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_20|, ~__unbuffered_p1_EAX$r_buff1_thd0~0=v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8, ~__unbuffered_p1_EAX$flush_delayed~0=v_~__unbuffered_p1_EAX$flush_delayed~0_8, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_267, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_10|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_56, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_47|, ~__unbuffered_p1_EAX$mem_tmp~0=v_~__unbuffered_p1_EAX$mem_tmp~0_8, ULTIMATE.start_main_~#t1965~0.base=|v_ULTIMATE.start_main_~#t1965~0.base_23|, ~y~0=v_~y~0_37, ~__unbuffered_p1_EAX$r_buff0_thd3~0=v_~__unbuffered_p1_EAX$r_buff0_thd3~0_5, ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_28|, ~__unbuffered_p1_EAX$r_buff1_thd1~0=v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_248, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_544, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_28|, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1098, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_40|, ~__unbuffered_p1_EAX$w_buff0_used~0=v_~__unbuffered_p1_EAX$w_buff0_used~0_7, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_278|, ~#x~0.base=|v_~#x~0.base_152|, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_37|, ~z~0=v_~z~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_80, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet74, ~__unbuffered_p1_EAX$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff1_thd2~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ULTIMATE.start_main_~#t1966~0.base, ~x$r_buff0_thd3~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$w_buff0~0, ~__unbuffered_p1_EAX$read_delayed_var~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1964~0.offset, ULTIMATE.start_main_~#t1964~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff0_thd1~0, ~#x~0.offset, ~x$w_buff1~0, ~__unbuffered_p1_EAX$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_~#t1965~0.offset, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~nondet83, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~__unbuffered_p1_EAX$w_buff1_used~0, ULTIMATE.start_main_#t~ite80, ~__unbuffered_p1_EAX$w_buff1~0, ULTIMATE.start_main_~#t1966~0.offset, ~__unbuffered_cnt~0, ~__unbuffered_p1_EAX$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet75, ~__unbuffered_p1_EAX$r_buff1_thd0~0, ~__unbuffered_p1_EAX$flush_delayed~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet73, ~__unbuffered_p1_EAX$read_delayed~0, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite86, ~__unbuffered_p1_EAX$mem_tmp~0, ULTIMATE.start_main_~#t1965~0.base, ~y~0, ~__unbuffered_p1_EAX$r_buff0_thd3~0, ULTIMATE.start_main_#t~mem76, ~__unbuffered_p1_EAX$r_buff1_thd1~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite78, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite85, ~__unbuffered_p1_EAX$w_buff0_used~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, #valid, #memory_int, ~#x~0.base, ULTIMATE.start_main_#t~mem84, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:03:53,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1200] [1200] L840-1-->L842: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1965~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1965~0.base_11| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1965~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1965~0.offset_9|) (= |v_#memory_int_154| (store |v_#memory_int_155| |v_ULTIMATE.start_main_~#t1965~0.base_11| (store (select |v_#memory_int_155| |v_ULTIMATE.start_main_~#t1965~0.base_11|) |v_ULTIMATE.start_main_~#t1965~0.offset_9| 1))) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1965~0.base_11| 1) |v_#valid_38|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1965~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_155|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_4|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_154|, ULTIMATE.start_main_~#t1965~0.base=|v_ULTIMATE.start_main_~#t1965~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1965~0.offset=|v_ULTIMATE.start_main_~#t1965~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet73, #valid, #memory_int, ULTIMATE.start_main_~#t1965~0.base, #length, ULTIMATE.start_main_~#t1965~0.offset] because there is no mapped edge [2019-12-07 11:03:53,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1204] [1204] L842-1-->L844: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1966~0.base_11| 4)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1966~0.base_11|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1966~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t1966~0.offset_9|) (= |v_#memory_int_156| (store |v_#memory_int_157| |v_ULTIMATE.start_main_~#t1966~0.base_11| (store (select |v_#memory_int_157| |v_ULTIMATE.start_main_~#t1966~0.base_11|) |v_ULTIMATE.start_main_~#t1966~0.offset_9| 2))) (not (= |v_ULTIMATE.start_main_~#t1966~0.base_11| 0)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1966~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_157|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_3|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t1966~0.offset=|v_ULTIMATE.start_main_~#t1966~0.offset_9|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1966~0.base=|v_ULTIMATE.start_main_~#t1966~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet74, #valid, #memory_int, ULTIMATE.start_main_~#t1966~0.offset, #length, ULTIMATE.start_main_~#t1966~0.base] because there is no mapped edge [2019-12-07 11:03:53,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L781-->L781-14: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1090921525 256) 0))) (or (and .cse0 (= ~x$w_buff0~0_In-1090921525 |P1Thread1of1ForFork0_#t~ite28_Out-1090921525|) (= (mod ~x$w_buff0_used~0_In-1090921525 256) 0) (= |P1Thread1of1ForFork0_#t~ite29_Out-1090921525| |P1Thread1of1ForFork0_#t~ite28_Out-1090921525|)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-1090921525| ~x$w_buff0~0_In-1090921525) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_In-1090921525| |P1Thread1of1ForFork0_#t~ite28_Out-1090921525|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1090921525, ~weak$$choice2~0=~weak$$choice2~0_In-1090921525, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_In-1090921525|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1090921525} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1090921525, ~weak$$choice2~0=~weak$$choice2~0_In-1090921525, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1090921525|, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1090921525|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1090921525} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28, P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:03:53,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1104] [1104] L785-->L786: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_111 v_~x$r_buff0_thd2~0_110)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_111, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork0_#t~ite47=|v_P1Thread1of1ForFork0_#t~ite47_9|, P1Thread1of1ForFork0_#t~ite46=|v_P1Thread1of1ForFork0_#t~ite46_9|, P1Thread1of1ForFork0_#t~ite45=|v_P1Thread1of1ForFork0_#t~ite45_6|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork0_#t~ite49=|v_P1Thread1of1ForFork0_#t~ite49_5|, P1Thread1of1ForFork0_#t~ite48=|v_P1Thread1of1ForFork0_#t~ite48_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite47, P1Thread1of1ForFork0_#t~ite46, P1Thread1of1ForFork0_#t~ite45, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite49, P1Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 11:03:53,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] L790-->L797: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= 1 v_~y~0_5) (= (store |v_#memory_int_40| |v_~#x~0.base_24| (store (select |v_#memory_int_40| |v_~#x~0.base_24|) |v_~#x~0.offset_24| v_~x$mem_tmp~0_4)) |v_#memory_int_39|) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~#x~0.offset=|v_~#x~0.offset_24|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, #memory_int=|v_#memory_int_40|, ~#x~0.base=|v_~#x~0.base_24|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P1Thread1of1ForFork0_#t~mem57=|v_P1Thread1of1ForFork0_#t~mem57_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~#x~0.offset=|v_~#x~0.offset_24|, P1Thread1of1ForFork0_#t~ite58=|v_P1Thread1of1ForFork0_#t~ite58_5|, #memory_int=|v_#memory_int_39|, ~#x~0.base=|v_~#x~0.base_24|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~y~0=v_~y~0_5} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem57, ~x$flush_delayed~0, P1Thread1of1ForFork0_#t~ite58, #memory_int, ~y~0] because there is no mapped edge [2019-12-07 11:03:53,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1175] [1175] L817-2-->L817-5: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1422806450 256))) (.cse0 (= |P2Thread1of1ForFork1_#t~ite68_Out1422806450| |P2Thread1of1ForFork1_#t~ite67_Out1422806450|)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1422806450 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~mem66_Out1422806450| (select (select |#memory_int_In1422806450| |~#x~0.base_In1422806450|) |~#x~0.offset_In1422806450|)) .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork1_#t~mem66_Out1422806450| |P2Thread1of1ForFork1_#t~ite67_Out1422806450|)) (and (not .cse2) .cse0 (= |P2Thread1of1ForFork1_#t~ite67_Out1422806450| ~x$w_buff1~0_In1422806450) (= |P2Thread1of1ForFork1_#t~mem66_In1422806450| |P2Thread1of1ForFork1_#t~mem66_Out1422806450|) (not .cse1)))) InVars {~#x~0.offset=|~#x~0.offset_In1422806450|, ~x$w_buff1~0=~x$w_buff1~0_In1422806450, ~#x~0.base=|~#x~0.base_In1422806450|, #memory_int=|#memory_int_In1422806450|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1422806450, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1422806450, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_In1422806450|} OutVars{P2Thread1of1ForFork1_#t~ite68=|P2Thread1of1ForFork1_#t~ite68_Out1422806450|, P2Thread1of1ForFork1_#t~ite67=|P2Thread1of1ForFork1_#t~ite67_Out1422806450|, ~#x~0.offset=|~#x~0.offset_In1422806450|, ~x$w_buff1~0=~x$w_buff1~0_In1422806450, ~#x~0.base=|~#x~0.base_In1422806450|, #memory_int=|#memory_int_In1422806450|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1422806450, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1422806450, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_Out1422806450|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite68, P2Thread1of1ForFork1_#t~ite67, P2Thread1of1ForFork1_#t~mem66] because there is no mapped edge [2019-12-07 11:03:53,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1158] [1158] L797-2-->L797-5: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In1766789498 256) 0)) (.cse0 (= |P1Thread1of1ForFork0_#t~ite60_Out1766789498| |P1Thread1of1ForFork0_#t~ite61_Out1766789498|)) (.cse2 (= (mod ~x$w_buff1_used~0_In1766789498 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork0_#t~ite60_Out1766789498| |P1Thread1of1ForFork0_#t~mem59_Out1766789498|) (= (select (select |#memory_int_In1766789498| |~#x~0.base_In1766789498|) |~#x~0.offset_In1766789498|) |P1Thread1of1ForFork0_#t~mem59_Out1766789498|)) (and (not .cse1) .cse0 (not .cse2) (= |P1Thread1of1ForFork0_#t~ite60_Out1766789498| ~x$w_buff1~0_In1766789498) (= |P1Thread1of1ForFork0_#t~mem59_In1766789498| |P1Thread1of1ForFork0_#t~mem59_Out1766789498|)))) InVars {P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_In1766789498|, ~#x~0.offset=|~#x~0.offset_In1766789498|, ~x$w_buff1~0=~x$w_buff1~0_In1766789498, ~#x~0.base=|~#x~0.base_In1766789498|, #memory_int=|#memory_int_In1766789498|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1766789498, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1766789498} OutVars{P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_Out1766789498|, ~#x~0.offset=|~#x~0.offset_In1766789498|, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out1766789498|, P1Thread1of1ForFork0_#t~ite61=|P1Thread1of1ForFork0_#t~ite61_Out1766789498|, ~x$w_buff1~0=~x$w_buff1~0_In1766789498, ~#x~0.base=|~#x~0.base_In1766789498|, #memory_int=|#memory_int_In1766789498|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1766789498, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1766789498} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem59, P1Thread1of1ForFork0_#t~ite60, P1Thread1of1ForFork0_#t~ite61] because there is no mapped edge [2019-12-07 11:03:53,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1097] [1097] P0ENTRY-->L4-3: Formula: (and (= v_~x$w_buff0~0_60 v_~x$w_buff1~0_46) (= |v_P0Thread1of1ForFork2_#in~arg.offset_17| v_P0Thread1of1ForFork2_~arg.offset_15) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_134 256) 0)) (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15|) (= v_~z~0_27 2) (= 1 v_~x$w_buff0~0_59) (= v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17 |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15|) (= v_~x$w_buff0_used~0_225 v_~x$w_buff1_used~0_134) (= 1 v_~x$w_buff0_used~0_224) (not (= 0 v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17)) (= v_P0Thread1of1ForFork2_~arg.base_15 |v_P0Thread1of1ForFork2_#in~arg.base_17|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_225} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_59, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, ~x$w_buff1~0=v_~x$w_buff1~0_46, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_134, P0Thread1of1ForFork2___VERIFIER_assert_~expression=v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~z~0=v_~z~0_27, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_15, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$w_buff1~0, P0Thread1of1ForFork2_~arg.offset, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~z~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 11:03:53,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-17117456 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-17117456 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite69_Out-17117456| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite69_Out-17117456| ~x$w_buff0_used~0_In-17117456) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-17117456, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-17117456} OutVars{P2Thread1of1ForFork1_#t~ite69=|P2Thread1of1ForFork1_#t~ite69_Out-17117456|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-17117456, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-17117456} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite69] because there is no mapped edge [2019-12-07 11:03:53,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1161] [1161] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-965868511 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-965868511 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-965868511 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-965868511 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite70_Out-965868511|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-965868511 |P2Thread1of1ForFork1_#t~ite70_Out-965868511|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-965868511, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-965868511, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-965868511, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-965868511} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-965868511, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-965868511, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-965868511, P2Thread1of1ForFork1_#t~ite70=|P2Thread1of1ForFork1_#t~ite70_Out-965868511|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-965868511} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite70] because there is no mapped edge [2019-12-07 11:03:53,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1109823137 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1109823137 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite62_Out1109823137| ~x$w_buff0_used~0_In1109823137) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite62_Out1109823137|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1109823137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1109823137} OutVars{P1Thread1of1ForFork0_#t~ite62=|P1Thread1of1ForFork0_#t~ite62_Out1109823137|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1109823137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1109823137} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite62] because there is no mapped edge [2019-12-07 11:03:53,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1177] [1177] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1468414387 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1468414387 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite71_Out1468414387| ~x$r_buff0_thd3~0_In1468414387) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite71_Out1468414387| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1468414387, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1468414387} OutVars{P2Thread1of1ForFork1_#t~ite71=|P2Thread1of1ForFork1_#t~ite71_Out1468414387|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1468414387, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1468414387} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite71] because there is no mapped edge [2019-12-07 11:03:53,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1164] [1164] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd3~0_In-225121314 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-225121314 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-225121314 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-225121314 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite72_Out-225121314| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite72_Out-225121314| ~x$r_buff1_thd3~0_In-225121314) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-225121314, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-225121314, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-225121314, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-225121314} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-225121314, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-225121314, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-225121314, P2Thread1of1ForFork1_#t~ite72=|P2Thread1of1ForFork1_#t~ite72_Out-225121314|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-225121314} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite72] because there is no mapped edge [2019-12-07 11:03:53,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L821-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= |v_P2Thread1of1ForFork1_#t~ite72_48| v_~x$r_buff1_thd3~0_197) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_48|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_197, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_47|, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#t~ite72, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 11:03:53,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1166] [1166] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In351433508 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In351433508 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In351433508 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In351433508 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite63_Out351433508|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In351433508 |P1Thread1of1ForFork0_#t~ite63_Out351433508|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In351433508, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In351433508, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In351433508, ~x$w_buff0_used~0=~x$w_buff0_used~0_In351433508} OutVars{P1Thread1of1ForFork0_#t~ite63=|P1Thread1of1ForFork0_#t~ite63_Out351433508|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In351433508, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In351433508, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In351433508, ~x$w_buff0_used~0=~x$w_buff0_used~0_In351433508} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite63] because there is no mapped edge [2019-12-07 11:03:53,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1001497984 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1001497984 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite64_Out-1001497984|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In-1001497984 |P1Thread1of1ForFork0_#t~ite64_Out-1001497984|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1001497984, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1001497984} OutVars{P1Thread1of1ForFork0_#t~ite64=|P1Thread1of1ForFork0_#t~ite64_Out-1001497984|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1001497984, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1001497984} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite64] because there is no mapped edge [2019-12-07 11:03:53,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1159] [1159] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-703467184 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-703467184 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-703467184 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-703467184 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite65_Out-703467184| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite65_Out-703467184| ~x$r_buff1_thd2~0_In-703467184)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-703467184, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-703467184, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-703467184, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-703467184} OutVars{P1Thread1of1ForFork0_#t~ite65=|P1Thread1of1ForFork0_#t~ite65_Out-703467184|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-703467184, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-703467184, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-703467184, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-703467184} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65] because there is no mapped edge [2019-12-07 11:03:53,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1211] [1211] L801-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_329 |v_P1Thread1of1ForFork0_#t~ite65_28|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_329, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 11:03:53,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1165] [1165] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1556381940 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1556381940 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out-1556381940| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1556381940 |P0Thread1of1ForFork2_#t~ite6_Out-1556381940|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1556381940, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1556381940} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1556381940, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1556381940|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1556381940} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 11:03:53,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1167] [1167] L763-->L763-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In629472419 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In629472419 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In629472419 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In629472419 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In629472419 |P0Thread1of1ForFork2_#t~ite7_Out629472419|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite7_Out629472419|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In629472419, ~x$w_buff1_used~0=~x$w_buff1_used~0_In629472419, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In629472419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In629472419} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In629472419, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out629472419|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In629472419, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In629472419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In629472419} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 11:03:53,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1176] [1176] L764-->L765: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1746058200 256) 0)) (.cse2 (= ~x$r_buff0_thd1~0_In-1746058200 ~x$r_buff0_thd1~0_Out-1746058200)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1746058200 256) 0))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd1~0_Out-1746058200) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1746058200, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1746058200} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1746058200, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1746058200|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1746058200} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 11:03:53,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1172] [1172] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In610783480 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In610783480 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In610783480 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In610783480 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out610783480| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In610783480 |P0Thread1of1ForFork2_#t~ite9_Out610783480|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In610783480, ~x$w_buff1_used~0=~x$w_buff1_used~0_In610783480, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In610783480, ~x$w_buff0_used~0=~x$w_buff0_used~0_In610783480} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In610783480, ~x$w_buff1_used~0=~x$w_buff1_used~0_In610783480, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In610783480, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out610783480|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In610783480} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 11:03:53,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1225] [1225] L765-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite9_30| v_~x$r_buff1_thd1~0_174) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_30|} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_174, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_29|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite9, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 11:03:53,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1147] [1147] L848-->L850-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~x$r_buff0_thd0~0_50 256)) (= 0 (mod v_~x$w_buff0_used~0_403 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_403} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_403} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:03:53,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L850-2-->L850-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite78_Out-219579591| |ULTIMATE.start_main_#t~ite77_Out-219579591|)) (.cse1 (= (mod ~x$w_buff1_used~0_In-219579591 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-219579591 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= (select (select |#memory_int_In-219579591| |~#x~0.base_In-219579591|) |~#x~0.offset_In-219579591|) |ULTIMATE.start_main_#t~mem76_Out-219579591|) (= |ULTIMATE.start_main_#t~mem76_Out-219579591| |ULTIMATE.start_main_#t~ite77_Out-219579591|)) (and .cse0 (not .cse1) (not .cse2) (= ~x$w_buff1~0_In-219579591 |ULTIMATE.start_main_#t~ite77_Out-219579591|) (= |ULTIMATE.start_main_#t~mem76_In-219579591| |ULTIMATE.start_main_#t~mem76_Out-219579591|)))) InVars {ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_In-219579591|, ~#x~0.offset=|~#x~0.offset_In-219579591|, ~x$w_buff1~0=~x$w_buff1~0_In-219579591, ~#x~0.base=|~#x~0.base_In-219579591|, #memory_int=|#memory_int_In-219579591|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-219579591, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-219579591} OutVars{ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_Out-219579591|, ~#x~0.offset=|~#x~0.offset_In-219579591|, ~x$w_buff1~0=~x$w_buff1~0_In-219579591, ~#x~0.base=|~#x~0.base_In-219579591|, #memory_int=|#memory_int_In-219579591|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-219579591, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out-219579591|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-219579591, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out-219579591|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-07 11:03:53,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1155] [1155] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-2062646798 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2062646798 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite79_Out-2062646798| 0)) (and (= |ULTIMATE.start_main_#t~ite79_Out-2062646798| ~x$w_buff0_used~0_In-2062646798) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2062646798, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2062646798} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2062646798, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out-2062646798|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2062646798} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite79] because there is no mapped edge [2019-12-07 11:03:53,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1180] [1180] L852-->L852-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-786593187 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-786593187 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-786593187 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-786593187 256)))) (or (and (= |ULTIMATE.start_main_#t~ite80_Out-786593187| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-786593187 |ULTIMATE.start_main_#t~ite80_Out-786593187|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-786593187, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-786593187, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-786593187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-786593187} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-786593187, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out-786593187|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-786593187, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-786593187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-786593187} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite80] because there is no mapped edge [2019-12-07 11:03:53,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1169] [1169] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-872936135 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-872936135 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite81_Out-872936135| 0)) (and (= ~x$r_buff0_thd0~0_In-872936135 |ULTIMATE.start_main_#t~ite81_Out-872936135|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-872936135, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-872936135} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-872936135, ULTIMATE.start_main_#t~ite81=|ULTIMATE.start_main_#t~ite81_Out-872936135|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-872936135} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite81] because there is no mapped edge [2019-12-07 11:03:53,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1154] [1154] L854-->L854-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1623938411 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-1623938411 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1623938411 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1623938411 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite82_Out-1623938411| ~x$r_buff1_thd0~0_In-1623938411)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite82_Out-1623938411| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1623938411, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1623938411, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1623938411, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1623938411} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1623938411, ULTIMATE.start_main_#t~ite82=|ULTIMATE.start_main_#t~ite82_Out-1623938411|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1623938411, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1623938411, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1623938411} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite82] because there is no mapped edge [2019-12-07 11:03:53,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1152] [1152] L858-->L858-3: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice1~0_In-522715394 256))) (.cse0 (not (= 0 (mod ~__unbuffered_p1_EAX$read_delayed~0_In-522715394 256))))) (or (and (= |ULTIMATE.start_main_#t~mem84_In-522715394| |ULTIMATE.start_main_#t~mem84_Out-522715394|) (= ~__unbuffered_p1_EAX~0_In-522715394 |ULTIMATE.start_main_#t~ite85_Out-522715394|) .cse0 .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~mem84_Out-522715394| |ULTIMATE.start_main_#t~ite85_Out-522715394|) .cse0 (= (select (select |#memory_int_In-522715394| ~__unbuffered_p1_EAX$read_delayed_var~0.base_In-522715394) ~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-522715394) |ULTIMATE.start_main_#t~mem84_Out-522715394|)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In-522715394, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-522715394, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In-522715394, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-522715394, #memory_int=|#memory_int_In-522715394|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-522715394, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_In-522715394|} OutVars{ULTIMATE.start_main_#t~ite85=|ULTIMATE.start_main_#t~ite85_Out-522715394|, ~weak$$choice1~0=~weak$$choice1~0_In-522715394, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-522715394, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In-522715394, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-522715394, #memory_int=|#memory_int_In-522715394|, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_Out-522715394|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-522715394} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~mem84] because there is no mapped edge [2019-12-07 11:03:53,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L858-3-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_11 256)) (let ((.cse3 (= 1 v_~__unbuffered_p2_EAX~0_17)) (.cse0 (= v_~z~0_57 2)) (.cse4 (= 1 v_~__unbuffered_p1_EAX~0_33)) (.cse1 (= |v_ULTIMATE.start_main_#t~ite85_21| v_~__unbuffered_p1_EAX~0_33)) (.cse2 (= v_~main$tmp_guard1~0_11 1))) (or (and (not .cse0) .cse1 .cse2) (and .cse1 .cse2 (not .cse3)) (and .cse3 .cse0 .cse4 .cse1 (= v_~main$tmp_guard1~0_11 0)) (and (not .cse4) .cse1 .cse2)))) InVars {ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~z~0=v_~z~0_57} OutVars{ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_20|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~z~0=v_~z~0_57, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start___VERIFIER_assert_~expression, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~mem84, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite86] because there is no mapped edge [2019-12-07 11:03:53,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1194] [1194] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 11:03:53,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:03:53 BasicIcfg [2019-12-07 11:03:53,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:03:53,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:03:53,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:03:53,840 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:03:53,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:01:44" (3/4) ... [2019-12-07 11:03:53,841 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:03:53,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse1 (store |v_#valid_66| 0 0))) (let ((.cse0 (store .cse1 |v_~#x~0.base_152| 1))) (and (= 0 v_~x$w_buff1~0_233) (= v_~__unbuffered_p1_EAX$r_buff1_thd2~0_7 0) (= 0 v_~weak$$choice0~0_156) (= 0 v_~x$r_buff1_thd3~0_230) (= (store .cse0 |v_ULTIMATE.start_main_~#t1964~0.base_24| 1) |v_#valid_64|) (= v_~__unbuffered_p1_EAX$r_buff0_thd3~0_5 0) (= |v_#length_30| (store (store |v_#length_31| |v_~#x~0.base_152| 4) |v_ULTIMATE.start_main_~#t1964~0.base_24| 4)) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_46 0) (= v_~x$r_buff0_thd0~0_121 0) (= 0 v_~weak$$choice1~0_85) (= v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8 0) (= |v_#memory_int_278| (store |v_#memory_int_279| |v_ULTIMATE.start_main_~#t1964~0.base_24| (store (select |v_#memory_int_279| |v_ULTIMATE.start_main_~#t1964~0.base_24|) |v_ULTIMATE.start_main_~#t1964~0.offset_19| 0))) (= 0 v_~x$r_buff0_thd2~0_544) (= v_~__unbuffered_p1_EAX$read_delayed~0_56 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1964~0.base_24|)) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1964~0.base_24|) (= 0 v_~x$read_delayed~0_8) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed_var~0.offset_8) (= v_~__unbuffered_p1_EAX$w_buff1_used~0_8 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_46 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8 0) (= v_~__unbuffered_cnt~0_122 0) (= v_~main$tmp_guard1~0_23 0) (= v_~x$r_buff1_thd0~0_248 0) (= v_~__unbuffered_p1_EAX$w_buff0~0_8 0) (= 0 v_~x$w_buff0~0_313) (= v_~main$tmp_guard0~0_32 0) (= v_~x$w_buff0_used~0_1098 0) (= v_~y~0_37 0) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EAX$r_buff0_thd1~0_8 0) (= (select .cse1 |v_~#x~0.base_152|) 0) (= 0 v_~weak$$choice2~0_80) (= (select (select |v_#memory_int_279| |v_~#x~0.base_152|) |v_~#x~0.offset_152|) 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7 0) (= v_~__unbuffered_p1_EAX$w_buff1~0_8 0) (= 0 |v_ULTIMATE.start_main_~#t1964~0.offset_19|) (< 0 |v_#StackHeapBarrier_19|) (= v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8 0) (= v_~__unbuffered_p1_EAX$flush_delayed~0_8 0) (= 0 v_~x$read_delayed_var~0.base_8) (< |v_#StackHeapBarrier_19| |v_~#x~0.base_152|) (= v_~z~0_125 0) (= 0 v_~x$r_buff1_thd2~0_577) (= v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8 0) (= 0 |v_~#x~0.offset_152|) (= 0 v_~__unbuffered_p1_EAX~0_67) (= v_~x$r_buff1_thd1~0_213 0) (= v_~__unbuffered_p1_EAX$w_buff0_used~0_7 0) (= v_~x$mem_tmp~0_18 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$w_buff1_used~0_667) (= 0 v_~x$r_buff0_thd3~0_135) (= v_~x$r_buff0_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_38) (= 0 v_~__unbuffered_p1_EAX$mem_tmp~0_8)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_279|, #length=|v_#length_31|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_313, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_9|, ~__unbuffered_p1_EAX$r_buff0_thd0~0=v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX$r_buff1_thd2~0=v_~__unbuffered_p1_EAX$r_buff1_thd2~0_7, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_213, ULTIMATE.start_main_~#t1966~0.base=|v_ULTIMATE.start_main_~#t1966~0.base_21|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_135, ~weak$$choice1~0=v_~weak$$choice1~0_85, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ~__unbuffered_p1_EAX$w_buff0~0=v_~__unbuffered_p1_EAX$w_buff0~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_46, #length=|v_#length_30|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ULTIMATE.start_main_~#t1964~0.offset=|v_ULTIMATE.start_main_~#t1964~0.offset_19|, ULTIMATE.start_main_~#t1964~0.base=|v_ULTIMATE.start_main_~#t1964~0.base_24|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_121, ~__unbuffered_p1_EAX$r_buff0_thd1~0=v_~__unbuffered_p1_EAX$r_buff0_thd1~0_8, ~#x~0.offset=|v_~#x~0.offset_152|, ~x$w_buff1~0=v_~x$w_buff1~0_233, ~__unbuffered_p1_EAX$r_buff1_thd3~0=v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_667, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_577, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_73|, ULTIMATE.start_main_~#t1965~0.offset=|v_ULTIMATE.start_main_~#t1965~0.offset_17|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_29|, ULTIMATE.start_main_#t~nondet83=|v_ULTIMATE.start_main_#t~nondet83_91|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_156, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_105|, ~__unbuffered_p1_EAX$w_buff1_used~0=v_~__unbuffered_p1_EAX$w_buff1_used~0_8, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_83|, ~__unbuffered_p1_EAX$w_buff1~0=v_~__unbuffered_p1_EAX$w_buff1~0_8, ULTIMATE.start_main_~#t1966~0.offset=|v_ULTIMATE.start_main_~#t1966~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122, ~__unbuffered_p1_EAX$r_buff0_thd2~0=v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_20|, ~__unbuffered_p1_EAX$r_buff1_thd0~0=v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8, ~__unbuffered_p1_EAX$flush_delayed~0=v_~__unbuffered_p1_EAX$flush_delayed~0_8, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_267, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_10|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_56, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_47|, ~__unbuffered_p1_EAX$mem_tmp~0=v_~__unbuffered_p1_EAX$mem_tmp~0_8, ULTIMATE.start_main_~#t1965~0.base=|v_ULTIMATE.start_main_~#t1965~0.base_23|, ~y~0=v_~y~0_37, ~__unbuffered_p1_EAX$r_buff0_thd3~0=v_~__unbuffered_p1_EAX$r_buff0_thd3~0_5, ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_28|, ~__unbuffered_p1_EAX$r_buff1_thd1~0=v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_248, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_544, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_28|, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1098, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_40|, ~__unbuffered_p1_EAX$w_buff0_used~0=v_~__unbuffered_p1_EAX$w_buff0_used~0_7, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_278|, ~#x~0.base=|v_~#x~0.base_152|, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_37|, ~z~0=v_~z~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_80, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet74, ~__unbuffered_p1_EAX$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff1_thd2~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ULTIMATE.start_main_~#t1966~0.base, ~x$r_buff0_thd3~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$w_buff0~0, ~__unbuffered_p1_EAX$read_delayed_var~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1964~0.offset, ULTIMATE.start_main_~#t1964~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff0_thd1~0, ~#x~0.offset, ~x$w_buff1~0, ~__unbuffered_p1_EAX$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_~#t1965~0.offset, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~nondet83, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~__unbuffered_p1_EAX$w_buff1_used~0, ULTIMATE.start_main_#t~ite80, ~__unbuffered_p1_EAX$w_buff1~0, ULTIMATE.start_main_~#t1966~0.offset, ~__unbuffered_cnt~0, ~__unbuffered_p1_EAX$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet75, ~__unbuffered_p1_EAX$r_buff1_thd0~0, ~__unbuffered_p1_EAX$flush_delayed~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet73, ~__unbuffered_p1_EAX$read_delayed~0, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite86, ~__unbuffered_p1_EAX$mem_tmp~0, ULTIMATE.start_main_~#t1965~0.base, ~y~0, ~__unbuffered_p1_EAX$r_buff0_thd3~0, ULTIMATE.start_main_#t~mem76, ~__unbuffered_p1_EAX$r_buff1_thd1~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite78, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite85, ~__unbuffered_p1_EAX$w_buff0_used~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, #valid, #memory_int, ~#x~0.base, ULTIMATE.start_main_#t~mem84, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:03:53,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1200] [1200] L840-1-->L842: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1965~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1965~0.base_11| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1965~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1965~0.offset_9|) (= |v_#memory_int_154| (store |v_#memory_int_155| |v_ULTIMATE.start_main_~#t1965~0.base_11| (store (select |v_#memory_int_155| |v_ULTIMATE.start_main_~#t1965~0.base_11|) |v_ULTIMATE.start_main_~#t1965~0.offset_9| 1))) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1965~0.base_11| 1) |v_#valid_38|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1965~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_155|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_4|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_154|, ULTIMATE.start_main_~#t1965~0.base=|v_ULTIMATE.start_main_~#t1965~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1965~0.offset=|v_ULTIMATE.start_main_~#t1965~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet73, #valid, #memory_int, ULTIMATE.start_main_~#t1965~0.base, #length, ULTIMATE.start_main_~#t1965~0.offset] because there is no mapped edge [2019-12-07 11:03:53,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1204] [1204] L842-1-->L844: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1966~0.base_11| 4)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1966~0.base_11|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1966~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t1966~0.offset_9|) (= |v_#memory_int_156| (store |v_#memory_int_157| |v_ULTIMATE.start_main_~#t1966~0.base_11| (store (select |v_#memory_int_157| |v_ULTIMATE.start_main_~#t1966~0.base_11|) |v_ULTIMATE.start_main_~#t1966~0.offset_9| 2))) (not (= |v_ULTIMATE.start_main_~#t1966~0.base_11| 0)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1966~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_157|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_3|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t1966~0.offset=|v_ULTIMATE.start_main_~#t1966~0.offset_9|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1966~0.base=|v_ULTIMATE.start_main_~#t1966~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet74, #valid, #memory_int, ULTIMATE.start_main_~#t1966~0.offset, #length, ULTIMATE.start_main_~#t1966~0.base] because there is no mapped edge [2019-12-07 11:03:53,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L781-->L781-14: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1090921525 256) 0))) (or (and .cse0 (= ~x$w_buff0~0_In-1090921525 |P1Thread1of1ForFork0_#t~ite28_Out-1090921525|) (= (mod ~x$w_buff0_used~0_In-1090921525 256) 0) (= |P1Thread1of1ForFork0_#t~ite29_Out-1090921525| |P1Thread1of1ForFork0_#t~ite28_Out-1090921525|)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-1090921525| ~x$w_buff0~0_In-1090921525) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_In-1090921525| |P1Thread1of1ForFork0_#t~ite28_Out-1090921525|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1090921525, ~weak$$choice2~0=~weak$$choice2~0_In-1090921525, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_In-1090921525|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1090921525} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1090921525, ~weak$$choice2~0=~weak$$choice2~0_In-1090921525, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1090921525|, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1090921525|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1090921525} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28, P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:03:53,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1104] [1104] L785-->L786: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_111 v_~x$r_buff0_thd2~0_110)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_111, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork0_#t~ite47=|v_P1Thread1of1ForFork0_#t~ite47_9|, P1Thread1of1ForFork0_#t~ite46=|v_P1Thread1of1ForFork0_#t~ite46_9|, P1Thread1of1ForFork0_#t~ite45=|v_P1Thread1of1ForFork0_#t~ite45_6|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork0_#t~ite49=|v_P1Thread1of1ForFork0_#t~ite49_5|, P1Thread1of1ForFork0_#t~ite48=|v_P1Thread1of1ForFork0_#t~ite48_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite47, P1Thread1of1ForFork0_#t~ite46, P1Thread1of1ForFork0_#t~ite45, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite49, P1Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 11:03:53,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] L790-->L797: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= 1 v_~y~0_5) (= (store |v_#memory_int_40| |v_~#x~0.base_24| (store (select |v_#memory_int_40| |v_~#x~0.base_24|) |v_~#x~0.offset_24| v_~x$mem_tmp~0_4)) |v_#memory_int_39|) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~#x~0.offset=|v_~#x~0.offset_24|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, #memory_int=|v_#memory_int_40|, ~#x~0.base=|v_~#x~0.base_24|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P1Thread1of1ForFork0_#t~mem57=|v_P1Thread1of1ForFork0_#t~mem57_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~#x~0.offset=|v_~#x~0.offset_24|, P1Thread1of1ForFork0_#t~ite58=|v_P1Thread1of1ForFork0_#t~ite58_5|, #memory_int=|v_#memory_int_39|, ~#x~0.base=|v_~#x~0.base_24|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~y~0=v_~y~0_5} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem57, ~x$flush_delayed~0, P1Thread1of1ForFork0_#t~ite58, #memory_int, ~y~0] because there is no mapped edge [2019-12-07 11:03:53,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1175] [1175] L817-2-->L817-5: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1422806450 256))) (.cse0 (= |P2Thread1of1ForFork1_#t~ite68_Out1422806450| |P2Thread1of1ForFork1_#t~ite67_Out1422806450|)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1422806450 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~mem66_Out1422806450| (select (select |#memory_int_In1422806450| |~#x~0.base_In1422806450|) |~#x~0.offset_In1422806450|)) .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork1_#t~mem66_Out1422806450| |P2Thread1of1ForFork1_#t~ite67_Out1422806450|)) (and (not .cse2) .cse0 (= |P2Thread1of1ForFork1_#t~ite67_Out1422806450| ~x$w_buff1~0_In1422806450) (= |P2Thread1of1ForFork1_#t~mem66_In1422806450| |P2Thread1of1ForFork1_#t~mem66_Out1422806450|) (not .cse1)))) InVars {~#x~0.offset=|~#x~0.offset_In1422806450|, ~x$w_buff1~0=~x$w_buff1~0_In1422806450, ~#x~0.base=|~#x~0.base_In1422806450|, #memory_int=|#memory_int_In1422806450|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1422806450, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1422806450, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_In1422806450|} OutVars{P2Thread1of1ForFork1_#t~ite68=|P2Thread1of1ForFork1_#t~ite68_Out1422806450|, P2Thread1of1ForFork1_#t~ite67=|P2Thread1of1ForFork1_#t~ite67_Out1422806450|, ~#x~0.offset=|~#x~0.offset_In1422806450|, ~x$w_buff1~0=~x$w_buff1~0_In1422806450, ~#x~0.base=|~#x~0.base_In1422806450|, #memory_int=|#memory_int_In1422806450|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1422806450, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1422806450, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_Out1422806450|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite68, P2Thread1of1ForFork1_#t~ite67, P2Thread1of1ForFork1_#t~mem66] because there is no mapped edge [2019-12-07 11:03:53,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1158] [1158] L797-2-->L797-5: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In1766789498 256) 0)) (.cse0 (= |P1Thread1of1ForFork0_#t~ite60_Out1766789498| |P1Thread1of1ForFork0_#t~ite61_Out1766789498|)) (.cse2 (= (mod ~x$w_buff1_used~0_In1766789498 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork0_#t~ite60_Out1766789498| |P1Thread1of1ForFork0_#t~mem59_Out1766789498|) (= (select (select |#memory_int_In1766789498| |~#x~0.base_In1766789498|) |~#x~0.offset_In1766789498|) |P1Thread1of1ForFork0_#t~mem59_Out1766789498|)) (and (not .cse1) .cse0 (not .cse2) (= |P1Thread1of1ForFork0_#t~ite60_Out1766789498| ~x$w_buff1~0_In1766789498) (= |P1Thread1of1ForFork0_#t~mem59_In1766789498| |P1Thread1of1ForFork0_#t~mem59_Out1766789498|)))) InVars {P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_In1766789498|, ~#x~0.offset=|~#x~0.offset_In1766789498|, ~x$w_buff1~0=~x$w_buff1~0_In1766789498, ~#x~0.base=|~#x~0.base_In1766789498|, #memory_int=|#memory_int_In1766789498|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1766789498, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1766789498} OutVars{P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_Out1766789498|, ~#x~0.offset=|~#x~0.offset_In1766789498|, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out1766789498|, P1Thread1of1ForFork0_#t~ite61=|P1Thread1of1ForFork0_#t~ite61_Out1766789498|, ~x$w_buff1~0=~x$w_buff1~0_In1766789498, ~#x~0.base=|~#x~0.base_In1766789498|, #memory_int=|#memory_int_In1766789498|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1766789498, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1766789498} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem59, P1Thread1of1ForFork0_#t~ite60, P1Thread1of1ForFork0_#t~ite61] because there is no mapped edge [2019-12-07 11:03:53,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1097] [1097] P0ENTRY-->L4-3: Formula: (and (= v_~x$w_buff0~0_60 v_~x$w_buff1~0_46) (= |v_P0Thread1of1ForFork2_#in~arg.offset_17| v_P0Thread1of1ForFork2_~arg.offset_15) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_134 256) 0)) (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15|) (= v_~z~0_27 2) (= 1 v_~x$w_buff0~0_59) (= v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17 |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15|) (= v_~x$w_buff0_used~0_225 v_~x$w_buff1_used~0_134) (= 1 v_~x$w_buff0_used~0_224) (not (= 0 v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17)) (= v_P0Thread1of1ForFork2_~arg.base_15 |v_P0Thread1of1ForFork2_#in~arg.base_17|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_225} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_59, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, ~x$w_buff1~0=v_~x$w_buff1~0_46, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_134, P0Thread1of1ForFork2___VERIFIER_assert_~expression=v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~z~0=v_~z~0_27, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_15, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$w_buff1~0, P0Thread1of1ForFork2_~arg.offset, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~z~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 11:03:53,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-17117456 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-17117456 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite69_Out-17117456| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite69_Out-17117456| ~x$w_buff0_used~0_In-17117456) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-17117456, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-17117456} OutVars{P2Thread1of1ForFork1_#t~ite69=|P2Thread1of1ForFork1_#t~ite69_Out-17117456|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-17117456, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-17117456} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite69] because there is no mapped edge [2019-12-07 11:03:53,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1161] [1161] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-965868511 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-965868511 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-965868511 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-965868511 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite70_Out-965868511|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-965868511 |P2Thread1of1ForFork1_#t~ite70_Out-965868511|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-965868511, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-965868511, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-965868511, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-965868511} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-965868511, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-965868511, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-965868511, P2Thread1of1ForFork1_#t~ite70=|P2Thread1of1ForFork1_#t~ite70_Out-965868511|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-965868511} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite70] because there is no mapped edge [2019-12-07 11:03:53,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1109823137 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1109823137 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite62_Out1109823137| ~x$w_buff0_used~0_In1109823137) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite62_Out1109823137|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1109823137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1109823137} OutVars{P1Thread1of1ForFork0_#t~ite62=|P1Thread1of1ForFork0_#t~ite62_Out1109823137|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1109823137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1109823137} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite62] because there is no mapped edge [2019-12-07 11:03:53,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1177] [1177] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1468414387 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1468414387 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite71_Out1468414387| ~x$r_buff0_thd3~0_In1468414387) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite71_Out1468414387| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1468414387, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1468414387} OutVars{P2Thread1of1ForFork1_#t~ite71=|P2Thread1of1ForFork1_#t~ite71_Out1468414387|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1468414387, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1468414387} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite71] because there is no mapped edge [2019-12-07 11:03:53,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1164] [1164] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd3~0_In-225121314 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-225121314 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-225121314 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-225121314 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite72_Out-225121314| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite72_Out-225121314| ~x$r_buff1_thd3~0_In-225121314) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-225121314, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-225121314, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-225121314, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-225121314} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-225121314, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-225121314, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-225121314, P2Thread1of1ForFork1_#t~ite72=|P2Thread1of1ForFork1_#t~ite72_Out-225121314|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-225121314} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite72] because there is no mapped edge [2019-12-07 11:03:53,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L821-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= |v_P2Thread1of1ForFork1_#t~ite72_48| v_~x$r_buff1_thd3~0_197) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_48|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_197, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_47|, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#t~ite72, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 11:03:53,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1166] [1166] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In351433508 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In351433508 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In351433508 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In351433508 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite63_Out351433508|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In351433508 |P1Thread1of1ForFork0_#t~ite63_Out351433508|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In351433508, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In351433508, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In351433508, ~x$w_buff0_used~0=~x$w_buff0_used~0_In351433508} OutVars{P1Thread1of1ForFork0_#t~ite63=|P1Thread1of1ForFork0_#t~ite63_Out351433508|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In351433508, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In351433508, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In351433508, ~x$w_buff0_used~0=~x$w_buff0_used~0_In351433508} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite63] because there is no mapped edge [2019-12-07 11:03:53,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1001497984 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1001497984 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite64_Out-1001497984|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In-1001497984 |P1Thread1of1ForFork0_#t~ite64_Out-1001497984|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1001497984, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1001497984} OutVars{P1Thread1of1ForFork0_#t~ite64=|P1Thread1of1ForFork0_#t~ite64_Out-1001497984|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1001497984, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1001497984} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite64] because there is no mapped edge [2019-12-07 11:03:53,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1159] [1159] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-703467184 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-703467184 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-703467184 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-703467184 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite65_Out-703467184| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite65_Out-703467184| ~x$r_buff1_thd2~0_In-703467184)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-703467184, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-703467184, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-703467184, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-703467184} OutVars{P1Thread1of1ForFork0_#t~ite65=|P1Thread1of1ForFork0_#t~ite65_Out-703467184|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-703467184, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-703467184, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-703467184, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-703467184} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65] because there is no mapped edge [2019-12-07 11:03:53,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1211] [1211] L801-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_329 |v_P1Thread1of1ForFork0_#t~ite65_28|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_329, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 11:03:53,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1165] [1165] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1556381940 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1556381940 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out-1556381940| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1556381940 |P0Thread1of1ForFork2_#t~ite6_Out-1556381940|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1556381940, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1556381940} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1556381940, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1556381940|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1556381940} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 11:03:53,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1167] [1167] L763-->L763-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In629472419 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In629472419 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In629472419 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In629472419 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In629472419 |P0Thread1of1ForFork2_#t~ite7_Out629472419|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite7_Out629472419|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In629472419, ~x$w_buff1_used~0=~x$w_buff1_used~0_In629472419, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In629472419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In629472419} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In629472419, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out629472419|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In629472419, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In629472419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In629472419} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 11:03:53,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1176] [1176] L764-->L765: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1746058200 256) 0)) (.cse2 (= ~x$r_buff0_thd1~0_In-1746058200 ~x$r_buff0_thd1~0_Out-1746058200)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1746058200 256) 0))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd1~0_Out-1746058200) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1746058200, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1746058200} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1746058200, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1746058200|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1746058200} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 11:03:53,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1172] [1172] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In610783480 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In610783480 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In610783480 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In610783480 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out610783480| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In610783480 |P0Thread1of1ForFork2_#t~ite9_Out610783480|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In610783480, ~x$w_buff1_used~0=~x$w_buff1_used~0_In610783480, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In610783480, ~x$w_buff0_used~0=~x$w_buff0_used~0_In610783480} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In610783480, ~x$w_buff1_used~0=~x$w_buff1_used~0_In610783480, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In610783480, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out610783480|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In610783480} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 11:03:53,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1225] [1225] L765-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite9_30| v_~x$r_buff1_thd1~0_174) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_30|} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_174, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_29|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite9, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 11:03:53,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1147] [1147] L848-->L850-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~x$r_buff0_thd0~0_50 256)) (= 0 (mod v_~x$w_buff0_used~0_403 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_403} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_403} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:03:53,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L850-2-->L850-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite78_Out-219579591| |ULTIMATE.start_main_#t~ite77_Out-219579591|)) (.cse1 (= (mod ~x$w_buff1_used~0_In-219579591 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-219579591 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= (select (select |#memory_int_In-219579591| |~#x~0.base_In-219579591|) |~#x~0.offset_In-219579591|) |ULTIMATE.start_main_#t~mem76_Out-219579591|) (= |ULTIMATE.start_main_#t~mem76_Out-219579591| |ULTIMATE.start_main_#t~ite77_Out-219579591|)) (and .cse0 (not .cse1) (not .cse2) (= ~x$w_buff1~0_In-219579591 |ULTIMATE.start_main_#t~ite77_Out-219579591|) (= |ULTIMATE.start_main_#t~mem76_In-219579591| |ULTIMATE.start_main_#t~mem76_Out-219579591|)))) InVars {ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_In-219579591|, ~#x~0.offset=|~#x~0.offset_In-219579591|, ~x$w_buff1~0=~x$w_buff1~0_In-219579591, ~#x~0.base=|~#x~0.base_In-219579591|, #memory_int=|#memory_int_In-219579591|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-219579591, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-219579591} OutVars{ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_Out-219579591|, ~#x~0.offset=|~#x~0.offset_In-219579591|, ~x$w_buff1~0=~x$w_buff1~0_In-219579591, ~#x~0.base=|~#x~0.base_In-219579591|, #memory_int=|#memory_int_In-219579591|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-219579591, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out-219579591|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-219579591, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out-219579591|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-07 11:03:53,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1155] [1155] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-2062646798 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2062646798 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite79_Out-2062646798| 0)) (and (= |ULTIMATE.start_main_#t~ite79_Out-2062646798| ~x$w_buff0_used~0_In-2062646798) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2062646798, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2062646798} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2062646798, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out-2062646798|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2062646798} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite79] because there is no mapped edge [2019-12-07 11:03:53,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1180] [1180] L852-->L852-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-786593187 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-786593187 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-786593187 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-786593187 256)))) (or (and (= |ULTIMATE.start_main_#t~ite80_Out-786593187| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-786593187 |ULTIMATE.start_main_#t~ite80_Out-786593187|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-786593187, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-786593187, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-786593187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-786593187} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-786593187, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out-786593187|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-786593187, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-786593187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-786593187} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite80] because there is no mapped edge [2019-12-07 11:03:53,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1169] [1169] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-872936135 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-872936135 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite81_Out-872936135| 0)) (and (= ~x$r_buff0_thd0~0_In-872936135 |ULTIMATE.start_main_#t~ite81_Out-872936135|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-872936135, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-872936135} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-872936135, ULTIMATE.start_main_#t~ite81=|ULTIMATE.start_main_#t~ite81_Out-872936135|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-872936135} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite81] because there is no mapped edge [2019-12-07 11:03:53,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1154] [1154] L854-->L854-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1623938411 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-1623938411 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1623938411 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1623938411 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite82_Out-1623938411| ~x$r_buff1_thd0~0_In-1623938411)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite82_Out-1623938411| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1623938411, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1623938411, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1623938411, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1623938411} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1623938411, ULTIMATE.start_main_#t~ite82=|ULTIMATE.start_main_#t~ite82_Out-1623938411|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1623938411, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1623938411, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1623938411} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite82] because there is no mapped edge [2019-12-07 11:03:53,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1152] [1152] L858-->L858-3: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice1~0_In-522715394 256))) (.cse0 (not (= 0 (mod ~__unbuffered_p1_EAX$read_delayed~0_In-522715394 256))))) (or (and (= |ULTIMATE.start_main_#t~mem84_In-522715394| |ULTIMATE.start_main_#t~mem84_Out-522715394|) (= ~__unbuffered_p1_EAX~0_In-522715394 |ULTIMATE.start_main_#t~ite85_Out-522715394|) .cse0 .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~mem84_Out-522715394| |ULTIMATE.start_main_#t~ite85_Out-522715394|) .cse0 (= (select (select |#memory_int_In-522715394| ~__unbuffered_p1_EAX$read_delayed_var~0.base_In-522715394) ~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-522715394) |ULTIMATE.start_main_#t~mem84_Out-522715394|)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In-522715394, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-522715394, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In-522715394, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-522715394, #memory_int=|#memory_int_In-522715394|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-522715394, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_In-522715394|} OutVars{ULTIMATE.start_main_#t~ite85=|ULTIMATE.start_main_#t~ite85_Out-522715394|, ~weak$$choice1~0=~weak$$choice1~0_In-522715394, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-522715394, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In-522715394, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-522715394, #memory_int=|#memory_int_In-522715394|, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_Out-522715394|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-522715394} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~mem84] because there is no mapped edge [2019-12-07 11:03:53,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L858-3-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_11 256)) (let ((.cse3 (= 1 v_~__unbuffered_p2_EAX~0_17)) (.cse0 (= v_~z~0_57 2)) (.cse4 (= 1 v_~__unbuffered_p1_EAX~0_33)) (.cse1 (= |v_ULTIMATE.start_main_#t~ite85_21| v_~__unbuffered_p1_EAX~0_33)) (.cse2 (= v_~main$tmp_guard1~0_11 1))) (or (and (not .cse0) .cse1 .cse2) (and .cse1 .cse2 (not .cse3)) (and .cse3 .cse0 .cse4 .cse1 (= v_~main$tmp_guard1~0_11 0)) (and (not .cse4) .cse1 .cse2)))) InVars {ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~z~0=v_~z~0_57} OutVars{ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_20|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~z~0=v_~z~0_57, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start___VERIFIER_assert_~expression, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~mem84, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite86] because there is no mapped edge [2019-12-07 11:03:53,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1194] [1194] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 11:03:53,927 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_08d9aa2c-f4a2-4acb-9b56-294ee1c50bdf/bin/utaipan/witness.graphml [2019-12-07 11:03:53,927 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:03:53,928 INFO L168 Benchmark]: Toolchain (without parser) took 129965.35 ms. Allocated memory was 1.0 GB in the beginning and 6.6 GB in the end (delta: 5.5 GB). Free memory was 939.8 MB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-12-07 11:03:53,928 INFO L168 Benchmark]: CDTParser took 0.17 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 11:03:53,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -110.7 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:03:53,929 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.21 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 11:03:53,929 INFO L168 Benchmark]: Boogie Preprocessor took 29.55 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:03:53,929 INFO L168 Benchmark]: RCFGBuilder took 475.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 973.8 MB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:03:53,930 INFO L168 Benchmark]: TraceAbstraction took 128928.18 ms. Allocated memory was 1.1 GB in the beginning and 6.6 GB in the end (delta: 5.4 GB). Free memory was 973.8 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-12-07 11:03:53,930 INFO L168 Benchmark]: Witness Printer took 87.92 ms. Allocated memory is still 6.6 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 65.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:03:53,931 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 399.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -110.7 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.21 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. * Boogie Preprocessor took 29.55 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 475.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 973.8 MB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 128928.18 ms. Allocated memory was 1.1 GB in the beginning and 6.6 GB in the end (delta: 5.4 GB). Free memory was 973.8 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 87.92 ms. Allocated memory is still 6.6 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 65.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 235 ProgramPointsBefore, 118 ProgramPointsAfterwards, 293 TransitionsBefore, 145 TransitionsAfterwards, 31682 CoEnabledTransitionPairs, 8 FixpointIterations, 50 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 67 ConcurrentYvCompositions, 35 ChoiceCompositions, 11793 VarBasedMoverChecksPositive, 337 VarBasedMoverChecksNegative, 111 SemBasedMoverChecksPositive, 344 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 167242 CheckedPairsTotal, 175 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t1964, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5: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] [L842] FCALL, FORK 0 pthread_create(&t1965, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5: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] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 x$flush_delayed = weak$$choice2 [L778] EXPR 2 \read(x) [L778] 2 x$mem_tmp = x [L779] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L780] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L780] EXPR 2 \read(x) [L780] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) VAL [!x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))=0, \read(x)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={5:0}, x$flush_delayed=1, 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] [L780] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L844] FCALL, FORK 0 pthread_create(&t1966, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={5:0}, x$flush_delayed=1, 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] [L781] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L782] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))))=0, x={5:0}, x$flush_delayed=1, 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] [L782] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L783] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0))))=0, x={5:0}, x$flush_delayed=1, 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] [L783] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L784] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))))=0, x={5:0}, x$flush_delayed=1, 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] [L784] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L786] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))))=0, x={5:0}, x$flush_delayed=1, 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] [L786] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L787] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L788] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L789] EXPR 2 \read(x) [L789] 2 __unbuffered_p1_EAX = x [L811] 3 __unbuffered_p2_EAX = y [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={5: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=1, z=1] [L817] EXPR 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_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={5: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=1, z=1] [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 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_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={5: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=1, z=1] [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 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) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L819] 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 [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 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 [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L754] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L755] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L756] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L757] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L758] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L761] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L763] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L850] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L851] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L852] 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 [L853] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L854] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L857] 0 weak$$choice1 = __VERIFIER_nondet_bool() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 226 locations, 2 error locations. Result: UNSAFE, OverallTime: 128.7s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 25.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6660 SDtfs, 9429 SDslu, 13309 SDs, 0 SdLazy, 9867 SolverSat, 572 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 51 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303600occurred 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: 55.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 411792 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 940 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 844 ConstructedInterpolants, 0 QuantifiedInterpolants, 116318 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...