./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix005_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_aca4bd16-5196-493c-ac4b-af4b940c0cfe/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_aca4bd16-5196-493c-ac4b-af4b940c0cfe/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_aca4bd16-5196-493c-ac4b-af4b940c0cfe/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_aca4bd16-5196-493c-ac4b-af4b940c0cfe/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix005_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_aca4bd16-5196-493c-ac4b-af4b940c0cfe/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_aca4bd16-5196-493c-ac4b-af4b940c0cfe/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 980ec89413e13f177c74b7982607034e07937623 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:43:29,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:43:29,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:43:29,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:43:29,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:43:29,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:43:29,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:43:29,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:43:29,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:43:29,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:43:29,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:43:29,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:43:29,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:43:29,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:43:29,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:43:29,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:43:29,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:43:29,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:43:29,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:43:29,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:43:29,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:43:29,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:43:29,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:43:29,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:43:29,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:43:29,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:43:29,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:43:29,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:43:29,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:43:29,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:43:29,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:43:29,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:43:29,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:43:29,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:43:29,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:43:29,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:43:29,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:43:29,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:43:29,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:43:29,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:43:29,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:43:29,221 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_aca4bd16-5196-493c-ac4b-af4b940c0cfe/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:43:29,230 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:43:29,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:43:29,231 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:43:29,231 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:43:29,231 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:43:29,231 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:43:29,231 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:43:29,231 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:43:29,232 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:43:29,232 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:43:29,232 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:43:29,232 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:43:29,232 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:43:29,232 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:43:29,232 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:43:29,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:43:29,233 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:43:29,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:43:29,233 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:43:29,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:43:29,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:43:29,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:43:29,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:43:29,233 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:43:29,233 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:43:29,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:43:29,234 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:43:29,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:43:29,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:43:29,234 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:43:29,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:43:29,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:43:29,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:43:29,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:43:29,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:43:29,235 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:43:29,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:43:29,235 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:43:29,235 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:43:29,235 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:43:29,235 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_aca4bd16-5196-493c-ac4b-af4b940c0cfe/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 -> 980ec89413e13f177c74b7982607034e07937623 [2019-12-07 13:43:29,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:43:29,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:43:29,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:43:29,345 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:43:29,346 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:43:29,346 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_aca4bd16-5196-493c-ac4b-af4b940c0cfe/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix005_rmo.opt.i [2019-12-07 13:43:29,384 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aca4bd16-5196-493c-ac4b-af4b940c0cfe/bin/utaipan/data/a9e34eba1/18d45003a53147ed9b4a661d8795ed23/FLAG29f89fdfb [2019-12-07 13:43:29,764 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:43:29,765 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_aca4bd16-5196-493c-ac4b-af4b940c0cfe/sv-benchmarks/c/pthread-wmm/mix005_rmo.opt.i [2019-12-07 13:43:29,777 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aca4bd16-5196-493c-ac4b-af4b940c0cfe/bin/utaipan/data/a9e34eba1/18d45003a53147ed9b4a661d8795ed23/FLAG29f89fdfb [2019-12-07 13:43:29,785 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_aca4bd16-5196-493c-ac4b-af4b940c0cfe/bin/utaipan/data/a9e34eba1/18d45003a53147ed9b4a661d8795ed23 [2019-12-07 13:43:29,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:43:29,788 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:43:29,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:43:29,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:43:29,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:43:29,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:43:29" (1/1) ... [2019-12-07 13:43:29,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:29, skipping insertion in model container [2019-12-07 13:43:29,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:43:29" (1/1) ... [2019-12-07 13:43:29,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:43:29,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:43:30,079 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:43:30,086 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:43:30,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:43:30,177 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:43:30,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:30 WrapperNode [2019-12-07 13:43:30,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:43:30,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:43:30,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:43:30,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:43:30,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:30" (1/1) ... [2019-12-07 13:43:30,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:30" (1/1) ... [2019-12-07 13:43:30,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:43:30,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:43:30,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:43:30,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:43:30,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:30" (1/1) ... [2019-12-07 13:43:30,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:30" (1/1) ... [2019-12-07 13:43:30,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:30" (1/1) ... [2019-12-07 13:43:30,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:30" (1/1) ... [2019-12-07 13:43:30,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:30" (1/1) ... [2019-12-07 13:43:30,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:30" (1/1) ... [2019-12-07 13:43:30,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:30" (1/1) ... [2019-12-07 13:43:30,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:43:30,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:43:30,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:43:30,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:43:30,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aca4bd16-5196-493c-ac4b-af4b940c0cfe/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 13:43:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:43:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:43:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:43:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:43:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:43:30,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:43:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:43:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:43:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:43:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:43:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 13:43:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 13:43:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:43:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:43:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:43:30,291 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 13:43:30,684 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:43:30,685 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:43:30,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:43:30 BoogieIcfgContainer [2019-12-07 13:43:30,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:43:30,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:43:30,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:43:30,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:43:30,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:43:29" (1/3) ... [2019-12-07 13:43:30,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed0fbd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:43:30, skipping insertion in model container [2019-12-07 13:43:30,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:30" (2/3) ... [2019-12-07 13:43:30,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed0fbd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:43:30, skipping insertion in model container [2019-12-07 13:43:30,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:43:30" (3/3) ... [2019-12-07 13:43:30,690 INFO L109 eAbstractionObserver]: Analyzing ICFG mix005_rmo.opt.i [2019-12-07 13:43:30,696 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:43:30,696 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:43:30,701 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:43:30,702 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:43:30,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,730 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,730 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,731 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,731 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,732 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,732 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,743 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,743 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,743 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,743 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,744 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,744 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,744 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:30,767 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 13:43:30,779 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:43:30,779 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:43:30,780 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:43:30,780 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:43:30,780 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:43:30,780 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:43:30,780 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:43:30,780 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:43:30,790 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-07 13:43:30,791 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 13:43:30,860 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 13:43:30,860 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:43:30,874 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 941 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 13:43:30,897 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 13:43:30,936 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 13:43:30,936 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:43:30,945 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 941 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 13:43:30,971 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 13:43:30,971 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:43:34,643 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-07 13:43:34,837 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 13:43:34,955 INFO L206 etLargeBlockEncoding]: Checked pairs total: 141939 [2019-12-07 13:43:34,955 INFO L214 etLargeBlockEncoding]: Total number of compositions: 133 [2019-12-07 13:43:34,957 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 132 transitions [2019-12-07 13:43:42,261 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85966 states. [2019-12-07 13:43:42,263 INFO L276 IsEmpty]: Start isEmpty. Operand 85966 states. [2019-12-07 13:43:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:43:42,267 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:42,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:42,268 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:42,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:42,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1287441752, now seen corresponding path program 1 times [2019-12-07 13:43:42,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:43:42,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393038118] [2019-12-07 13:43:42,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:42,437 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 13:43:42,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393038118] [2019-12-07 13:43:42,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:42,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:43:42,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900531892] [2019-12-07 13:43:42,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:43:42,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:43:42,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:43:42,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:43:42,454 INFO L87 Difference]: Start difference. First operand 85966 states. Second operand 3 states. [2019-12-07 13:43:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:43,144 INFO L93 Difference]: Finished difference Result 85406 states and 393472 transitions. [2019-12-07 13:43:43,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:43:43,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 13:43:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:43,589 INFO L225 Difference]: With dead ends: 85406 [2019-12-07 13:43:43,589 INFO L226 Difference]: Without dead ends: 79558 [2019-12-07 13:43:43,590 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 13:43:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79558 states. [2019-12-07 13:43:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79558 to 79558. [2019-12-07 13:43:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79558 states. [2019-12-07 13:43:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79558 states to 79558 states and 366284 transitions. [2019-12-07 13:43:46,276 INFO L78 Accepts]: Start accepts. Automaton has 79558 states and 366284 transitions. Word has length 9 [2019-12-07 13:43:46,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:46,278 INFO L462 AbstractCegarLoop]: Abstraction has 79558 states and 366284 transitions. [2019-12-07 13:43:46,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:43:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 79558 states and 366284 transitions. [2019-12-07 13:43:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:43:46,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:46,286 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:46,287 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:46,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:46,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1721975953, now seen corresponding path program 1 times [2019-12-07 13:43:46,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:43:46,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84394576] [2019-12-07 13:43:46,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:46,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 13:43:46,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84394576] [2019-12-07 13:43:46,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:46,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:43:46,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307948692] [2019-12-07 13:43:46,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:43:46,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:43:46,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:43:46,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:43:46,356 INFO L87 Difference]: Start difference. First operand 79558 states and 366284 transitions. Second operand 4 states. [2019-12-07 13:43:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:48,644 INFO L93 Difference]: Finished difference Result 126790 states and 563012 transitions. [2019-12-07 13:43:48,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:43:48,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 13:43:48,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:49,016 INFO L225 Difference]: With dead ends: 126790 [2019-12-07 13:43:49,017 INFO L226 Difference]: Without dead ends: 126726 [2019-12-07 13:43:49,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:50,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126726 states. [2019-12-07 13:43:52,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126726 to 123582. [2019-12-07 13:43:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123582 states. [2019-12-07 13:43:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123582 states to 123582 states and 551516 transitions. [2019-12-07 13:43:52,475 INFO L78 Accepts]: Start accepts. Automaton has 123582 states and 551516 transitions. Word has length 15 [2019-12-07 13:43:52,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:52,476 INFO L462 AbstractCegarLoop]: Abstraction has 123582 states and 551516 transitions. [2019-12-07 13:43:52,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:43:52,476 INFO L276 IsEmpty]: Start isEmpty. Operand 123582 states and 551516 transitions. [2019-12-07 13:43:52,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:43:52,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:52,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:52,482 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:52,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:52,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1760528869, now seen corresponding path program 1 times [2019-12-07 13:43:52,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:43:52,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090871625] [2019-12-07 13:43:52,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:52,527 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 13:43:52,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090871625] [2019-12-07 13:43:52,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:52,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:43:52,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321474915] [2019-12-07 13:43:52,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:43:52,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:43:52,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:43:52,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:43:52,528 INFO L87 Difference]: Start difference. First operand 123582 states and 551516 transitions. Second operand 4 states. [2019-12-07 13:43:53,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:53,765 INFO L93 Difference]: Finished difference Result 159910 states and 703928 transitions. [2019-12-07 13:43:53,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:43:53,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 13:43:53,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:54,185 INFO L225 Difference]: With dead ends: 159910 [2019-12-07 13:43:54,185 INFO L226 Difference]: Without dead ends: 159850 [2019-12-07 13:43:54,186 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 13:43:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159850 states. [2019-12-07 13:43:59,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159850 to 141658. [2019-12-07 13:43:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141658 states. [2019-12-07 13:43:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141658 states to 141658 states and 629312 transitions. [2019-12-07 13:43:59,795 INFO L78 Accepts]: Start accepts. Automaton has 141658 states and 629312 transitions. Word has length 18 [2019-12-07 13:43:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:59,795 INFO L462 AbstractCegarLoop]: Abstraction has 141658 states and 629312 transitions. [2019-12-07 13:43:59,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:43:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 141658 states and 629312 transitions. [2019-12-07 13:43:59,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:43:59,807 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:59,807 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] [2019-12-07 13:43:59,807 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:59,807 INFO L82 PathProgramCache]: Analyzing trace with hash 176800759, now seen corresponding path program 1 times [2019-12-07 13:43:59,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:43:59,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578075359] [2019-12-07 13:43:59,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:59,865 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 13:43:59,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578075359] [2019-12-07 13:43:59,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:59,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:43:59,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670054859] [2019-12-07 13:43:59,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:43:59,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:43:59,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:43:59,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:43:59,867 INFO L87 Difference]: Start difference. First operand 141658 states and 629312 transitions. Second operand 3 states. [2019-12-07 13:44:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:00,762 INFO L93 Difference]: Finished difference Result 141658 states and 623292 transitions. [2019-12-07 13:44:00,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:44:00,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 13:44:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:01,144 INFO L225 Difference]: With dead ends: 141658 [2019-12-07 13:44:01,144 INFO L226 Difference]: Without dead ends: 141658 [2019-12-07 13:44:01,144 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 13:44:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141658 states. [2019-12-07 13:44:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141658 to 141210. [2019-12-07 13:44:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141210 states. [2019-12-07 13:44:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141210 states to 141210 states and 621644 transitions. [2019-12-07 13:44:05,017 INFO L78 Accepts]: Start accepts. Automaton has 141210 states and 621644 transitions. Word has length 20 [2019-12-07 13:44:05,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:05,017 INFO L462 AbstractCegarLoop]: Abstraction has 141210 states and 621644 transitions. [2019-12-07 13:44:05,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:44:05,017 INFO L276 IsEmpty]: Start isEmpty. Operand 141210 states and 621644 transitions. [2019-12-07 13:44:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:44:05,026 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:05,026 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] [2019-12-07 13:44:05,026 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:05,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:05,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1362298761, now seen corresponding path program 1 times [2019-12-07 13:44:05,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:05,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445026464] [2019-12-07 13:44:05,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:05,096 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 13:44:05,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445026464] [2019-12-07 13:44:05,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:05,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:44:05,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952882194] [2019-12-07 13:44:05,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:44:05,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:05,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:44:05,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:44:05,098 INFO L87 Difference]: Start difference. First operand 141210 states and 621644 transitions. Second operand 3 states. [2019-12-07 13:44:07,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:07,879 INFO L93 Difference]: Finished difference Result 211158 states and 888348 transitions. [2019-12-07 13:44:07,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:44:07,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 13:44:07,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:08,482 INFO L225 Difference]: With dead ends: 211158 [2019-12-07 13:44:08,483 INFO L226 Difference]: Without dead ends: 210684 [2019-12-07 13:44:08,483 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 13:44:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210684 states. [2019-12-07 13:44:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210684 to 204643. [2019-12-07 13:44:13,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204643 states. [2019-12-07 13:44:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204643 states to 204643 states and 868870 transitions. [2019-12-07 13:44:13,711 INFO L78 Accepts]: Start accepts. Automaton has 204643 states and 868870 transitions. Word has length 20 [2019-12-07 13:44:13,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:13,711 INFO L462 AbstractCegarLoop]: Abstraction has 204643 states and 868870 transitions. [2019-12-07 13:44:13,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:44:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 204643 states and 868870 transitions. [2019-12-07 13:44:13,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:44:13,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:13,725 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] [2019-12-07 13:44:13,725 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:13,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:13,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1524159362, now seen corresponding path program 1 times [2019-12-07 13:44:13,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:13,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886687974] [2019-12-07 13:44:13,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:13,780 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 13:44:13,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886687974] [2019-12-07 13:44:13,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:13,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:44:13,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217779449] [2019-12-07 13:44:13,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:13,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:13,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:13,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:13,781 INFO L87 Difference]: Start difference. First operand 204643 states and 868870 transitions. Second operand 4 states. [2019-12-07 13:44:15,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:15,114 INFO L93 Difference]: Finished difference Result 210337 states and 885473 transitions. [2019-12-07 13:44:15,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:44:15,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 13:44:15,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:15,698 INFO L225 Difference]: With dead ends: 210337 [2019-12-07 13:44:15,698 INFO L226 Difference]: Without dead ends: 210337 [2019-12-07 13:44:15,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:17,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210337 states. [2019-12-07 13:44:22,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210337 to 203314. [2019-12-07 13:44:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203314 states. [2019-12-07 13:44:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203314 states to 203314 states and 864339 transitions. [2019-12-07 13:44:23,834 INFO L78 Accepts]: Start accepts. Automaton has 203314 states and 864339 transitions. Word has length 21 [2019-12-07 13:44:23,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:23,834 INFO L462 AbstractCegarLoop]: Abstraction has 203314 states and 864339 transitions. [2019-12-07 13:44:23,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:23,834 INFO L276 IsEmpty]: Start isEmpty. Operand 203314 states and 864339 transitions. [2019-12-07 13:44:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:44:23,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:23,850 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] [2019-12-07 13:44:23,850 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:23,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:23,850 INFO L82 PathProgramCache]: Analyzing trace with hash -259475625, now seen corresponding path program 1 times [2019-12-07 13:44:23,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:23,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070743877] [2019-12-07 13:44:23,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:23,916 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 13:44:23,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070743877] [2019-12-07 13:44:23,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:23,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:44:23,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952178185] [2019-12-07 13:44:23,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:23,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:23,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:23,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:23,918 INFO L87 Difference]: Start difference. First operand 203314 states and 864339 transitions. Second operand 4 states. [2019-12-07 13:44:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:24,832 INFO L93 Difference]: Finished difference Result 204550 states and 859668 transitions. [2019-12-07 13:44:24,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:44:24,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 13:44:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:25,392 INFO L225 Difference]: With dead ends: 204550 [2019-12-07 13:44:25,392 INFO L226 Difference]: Without dead ends: 204550 [2019-12-07 13:44:25,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204550 states. [2019-12-07 13:44:30,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204550 to 200442. [2019-12-07 13:44:30,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200442 states. [2019-12-07 13:44:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200442 states to 200442 states and 848644 transitions. [2019-12-07 13:44:31,109 INFO L78 Accepts]: Start accepts. Automaton has 200442 states and 848644 transitions. Word has length 21 [2019-12-07 13:44:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:31,110 INFO L462 AbstractCegarLoop]: Abstraction has 200442 states and 848644 transitions. [2019-12-07 13:44:31,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 200442 states and 848644 transitions. [2019-12-07 13:44:31,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:44:31,126 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:31,126 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 13:44:31,127 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:31,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:31,127 INFO L82 PathProgramCache]: Analyzing trace with hash 556520531, now seen corresponding path program 1 times [2019-12-07 13:44:31,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:31,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132753807] [2019-12-07 13:44:31,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:31,189 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 13:44:31,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132753807] [2019-12-07 13:44:31,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:31,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:44:31,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167992258] [2019-12-07 13:44:31,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:31,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:31,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:31,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:31,190 INFO L87 Difference]: Start difference. First operand 200442 states and 848644 transitions. Second operand 4 states. [2019-12-07 13:44:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:34,104 INFO L93 Difference]: Finished difference Result 195814 states and 826909 transitions. [2019-12-07 13:44:34,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:44:34,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 13:44:34,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:34,607 INFO L225 Difference]: With dead ends: 195814 [2019-12-07 13:44:34,607 INFO L226 Difference]: Without dead ends: 195814 [2019-12-07 13:44:34,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:36,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195814 states. [2019-12-07 13:44:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195814 to 150542. [2019-12-07 13:44:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150542 states. [2019-12-07 13:44:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150542 states to 150542 states and 647366 transitions. [2019-12-07 13:44:39,225 INFO L78 Accepts]: Start accepts. Automaton has 150542 states and 647366 transitions. Word has length 22 [2019-12-07 13:44:39,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:39,225 INFO L462 AbstractCegarLoop]: Abstraction has 150542 states and 647366 transitions. [2019-12-07 13:44:39,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 150542 states and 647366 transitions. [2019-12-07 13:44:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 13:44:39,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:39,246 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] [2019-12-07 13:44:39,246 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:39,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:39,247 INFO L82 PathProgramCache]: Analyzing trace with hash -923267308, now seen corresponding path program 1 times [2019-12-07 13:44:39,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:39,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188071616] [2019-12-07 13:44:39,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:39,291 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 13:44:39,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188071616] [2019-12-07 13:44:39,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:39,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:44:39,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225151403] [2019-12-07 13:44:39,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:39,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:39,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:39,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:39,293 INFO L87 Difference]: Start difference. First operand 150542 states and 647366 transitions. Second operand 4 states. [2019-12-07 13:44:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:39,800 INFO L93 Difference]: Finished difference Result 128948 states and 513792 transitions. [2019-12-07 13:44:39,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:44:39,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 13:44:39,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:40,078 INFO L225 Difference]: With dead ends: 128948 [2019-12-07 13:44:40,078 INFO L226 Difference]: Without dead ends: 119415 [2019-12-07 13:44:40,079 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 13:44:41,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119415 states. [2019-12-07 13:44:42,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119415 to 119415. [2019-12-07 13:44:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119415 states. [2019-12-07 13:44:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119415 states to 119415 states and 479052 transitions. [2019-12-07 13:44:43,091 INFO L78 Accepts]: Start accepts. Automaton has 119415 states and 479052 transitions. Word has length 24 [2019-12-07 13:44:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:43,091 INFO L462 AbstractCegarLoop]: Abstraction has 119415 states and 479052 transitions. [2019-12-07 13:44:43,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 119415 states and 479052 transitions. [2019-12-07 13:44:43,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:44:43,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:43,108 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:43,108 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:43,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:43,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1096679272, now seen corresponding path program 1 times [2019-12-07 13:44:43,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:43,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006905302] [2019-12-07 13:44:43,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:43,146 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 13:44:43,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006905302] [2019-12-07 13:44:43,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:43,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:44:43,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11312703] [2019-12-07 13:44:43,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:44:43,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:43,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:44:43,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:44:43,147 INFO L87 Difference]: Start difference. First operand 119415 states and 479052 transitions. Second operand 5 states. [2019-12-07 13:44:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:44,276 INFO L93 Difference]: Finished difference Result 143702 states and 568940 transitions. [2019-12-07 13:44:44,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:44:44,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 13:44:44,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:44,614 INFO L225 Difference]: With dead ends: 143702 [2019-12-07 13:44:44,615 INFO L226 Difference]: Without dead ends: 143617 [2019-12-07 13:44:44,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:44:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143617 states. [2019-12-07 13:44:47,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143617 to 119706. [2019-12-07 13:44:47,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119706 states. [2019-12-07 13:44:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119706 states to 119706 states and 480170 transitions. [2019-12-07 13:44:47,855 INFO L78 Accepts]: Start accepts. Automaton has 119706 states and 480170 transitions. Word has length 25 [2019-12-07 13:44:47,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:47,856 INFO L462 AbstractCegarLoop]: Abstraction has 119706 states and 480170 transitions. [2019-12-07 13:44:47,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:44:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 119706 states and 480170 transitions. [2019-12-07 13:44:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 13:44:47,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:47,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:47,957 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:47,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:47,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1265576290, now seen corresponding path program 1 times [2019-12-07 13:44:47,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:47,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091535487] [2019-12-07 13:44:47,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:48,006 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 13:44:48,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091535487] [2019-12-07 13:44:48,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:48,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:44:48,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943609922] [2019-12-07 13:44:48,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:48,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:48,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:48,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:48,007 INFO L87 Difference]: Start difference. First operand 119706 states and 480170 transitions. Second operand 4 states. [2019-12-07 13:44:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:48,545 INFO L93 Difference]: Finished difference Result 151934 states and 587923 transitions. [2019-12-07 13:44:48,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:44:48,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 13:44:48,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:48,776 INFO L225 Difference]: With dead ends: 151934 [2019-12-07 13:44:48,776 INFO L226 Difference]: Without dead ends: 110589 [2019-12-07 13:44:48,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:50,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110589 states. [2019-12-07 13:44:51,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110589 to 101930. [2019-12-07 13:44:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101930 states. [2019-12-07 13:44:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101930 states to 101930 states and 382752 transitions. [2019-12-07 13:44:51,492 INFO L78 Accepts]: Start accepts. Automaton has 101930 states and 382752 transitions. Word has length 37 [2019-12-07 13:44:51,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:51,492 INFO L462 AbstractCegarLoop]: Abstraction has 101930 states and 382752 transitions. [2019-12-07 13:44:51,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:51,492 INFO L276 IsEmpty]: Start isEmpty. Operand 101930 states and 382752 transitions. [2019-12-07 13:44:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 13:44:51,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:51,581 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:51,581 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:51,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:51,581 INFO L82 PathProgramCache]: Analyzing trace with hash -408828653, now seen corresponding path program 1 times [2019-12-07 13:44:51,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:51,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628613889] [2019-12-07 13:44:51,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:51,641 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 13:44:51,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628613889] [2019-12-07 13:44:51,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:51,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:44:51,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979083333] [2019-12-07 13:44:51,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:51,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:51,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:51,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:51,642 INFO L87 Difference]: Start difference. First operand 101930 states and 382752 transitions. Second operand 4 states. [2019-12-07 13:44:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:52,324 INFO L93 Difference]: Finished difference Result 119807 states and 447229 transitions. [2019-12-07 13:44:52,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:44:52,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 13:44:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:52,579 INFO L225 Difference]: With dead ends: 119807 [2019-12-07 13:44:52,580 INFO L226 Difference]: Without dead ends: 119807 [2019-12-07 13:44:52,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119807 states. [2019-12-07 13:44:55,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119807 to 116825. [2019-12-07 13:44:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116825 states. [2019-12-07 13:44:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116825 states to 116825 states and 436690 transitions. [2019-12-07 13:44:55,538 INFO L78 Accepts]: Start accepts. Automaton has 116825 states and 436690 transitions. Word has length 37 [2019-12-07 13:44:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:55,538 INFO L462 AbstractCegarLoop]: Abstraction has 116825 states and 436690 transitions. [2019-12-07 13:44:55,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:55,538 INFO L276 IsEmpty]: Start isEmpty. Operand 116825 states and 436690 transitions. [2019-12-07 13:44:55,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 13:44:55,641 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:55,641 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:55,641 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:55,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:55,641 INFO L82 PathProgramCache]: Analyzing trace with hash -934440295, now seen corresponding path program 2 times [2019-12-07 13:44:55,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:55,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698220052] [2019-12-07 13:44:55,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:44:55,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698220052] [2019-12-07 13:44:55,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:55,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:44:55,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947389150] [2019-12-07 13:44:55,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:44:55,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:55,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:44:55,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:44:55,740 INFO L87 Difference]: Start difference. First operand 116825 states and 436690 transitions. Second operand 8 states. [2019-12-07 13:44:57,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:57,543 INFO L93 Difference]: Finished difference Result 221973 states and 864769 transitions. [2019-12-07 13:44:57,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 13:44:57,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-07 13:44:57,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:58,078 INFO L225 Difference]: With dead ends: 221973 [2019-12-07 13:44:58,079 INFO L226 Difference]: Without dead ends: 221973 [2019-12-07 13:44:58,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2019-12-07 13:44:59,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221973 states. [2019-12-07 13:45:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221973 to 159426. [2019-12-07 13:45:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159426 states. [2019-12-07 13:45:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159426 states to 159426 states and 598545 transitions. [2019-12-07 13:45:02,709 INFO L78 Accepts]: Start accepts. Automaton has 159426 states and 598545 transitions. Word has length 37 [2019-12-07 13:45:02,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:45:02,709 INFO L462 AbstractCegarLoop]: Abstraction has 159426 states and 598545 transitions. [2019-12-07 13:45:02,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:45:02,709 INFO L276 IsEmpty]: Start isEmpty. Operand 159426 states and 598545 transitions. [2019-12-07 13:45:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 13:45:02,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:45:02,876 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:45:02,876 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:45:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:45:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2002157563, now seen corresponding path program 3 times [2019-12-07 13:45:02,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:45:02,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675677933] [2019-12-07 13:45:02,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:45:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:45:02,973 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 13:45:02,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675677933] [2019-12-07 13:45:02,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:45:02,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:45:02,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357758807] [2019-12-07 13:45:02,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:45:02,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:45:02,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:45:02,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:45:02,974 INFO L87 Difference]: Start difference. First operand 159426 states and 598545 transitions. Second operand 9 states. [2019-12-07 13:45:04,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:45:04,507 INFO L93 Difference]: Finished difference Result 194612 states and 727935 transitions. [2019-12-07 13:45:04,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:45:04,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-07 13:45:04,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:45:04,860 INFO L225 Difference]: With dead ends: 194612 [2019-12-07 13:45:04,860 INFO L226 Difference]: Without dead ends: 174897 [2019-12-07 13:45:04,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-12-07 13:45:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174897 states. [2019-12-07 13:45:08,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174897 to 156686. [2019-12-07 13:45:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156686 states. [2019-12-07 13:45:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156686 states to 156686 states and 588301 transitions. [2019-12-07 13:45:08,643 INFO L78 Accepts]: Start accepts. Automaton has 156686 states and 588301 transitions. Word has length 37 [2019-12-07 13:45:08,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:45:08,643 INFO L462 AbstractCegarLoop]: Abstraction has 156686 states and 588301 transitions. [2019-12-07 13:45:08,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:45:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 156686 states and 588301 transitions. [2019-12-07 13:45:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 13:45:08,820 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:45:08,820 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] [2019-12-07 13:45:08,821 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:45:08,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:45:08,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1876105754, now seen corresponding path program 1 times [2019-12-07 13:45:08,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:45:08,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091387734] [2019-12-07 13:45:08,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:45:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:45:08,870 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 13:45:08,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091387734] [2019-12-07 13:45:08,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:45:08,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:45:08,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476561486] [2019-12-07 13:45:08,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:45:08,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:45:08,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:45:08,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:45:08,871 INFO L87 Difference]: Start difference. First operand 156686 states and 588301 transitions. Second operand 5 states. [2019-12-07 13:45:09,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:45:09,106 INFO L93 Difference]: Finished difference Result 68604 states and 232491 transitions. [2019-12-07 13:45:09,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:45:09,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-07 13:45:09,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:45:09,210 INFO L225 Difference]: With dead ends: 68604 [2019-12-07 13:45:09,210 INFO L226 Difference]: Without dead ends: 61476 [2019-12-07 13:45:09,211 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 13:45:09,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61476 states. [2019-12-07 13:45:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61476 to 61476. [2019-12-07 13:45:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61476 states. [2019-12-07 13:45:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61476 states to 61476 states and 207798 transitions. [2019-12-07 13:45:10,570 INFO L78 Accepts]: Start accepts. Automaton has 61476 states and 207798 transitions. Word has length 38 [2019-12-07 13:45:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:45:10,571 INFO L462 AbstractCegarLoop]: Abstraction has 61476 states and 207798 transitions. [2019-12-07 13:45:10,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:45:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 61476 states and 207798 transitions. [2019-12-07 13:45:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 13:45:10,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:45:10,618 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:45:10,618 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:45:10,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:45:10,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1377430370, now seen corresponding path program 1 times [2019-12-07 13:45:10,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:45:10,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369657569] [2019-12-07 13:45:10,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:45:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:45:10,666 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 13:45:10,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369657569] [2019-12-07 13:45:10,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:45:10,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:45:10,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463811662] [2019-12-07 13:45:10,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:45:10,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:45:10,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:45:10,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:45:10,667 INFO L87 Difference]: Start difference. First operand 61476 states and 207798 transitions. Second operand 6 states. [2019-12-07 13:45:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:45:10,743 INFO L93 Difference]: Finished difference Result 13753 states and 43212 transitions. [2019-12-07 13:45:10,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:45:10,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 13:45:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:45:10,756 INFO L225 Difference]: With dead ends: 13753 [2019-12-07 13:45:10,756 INFO L226 Difference]: Without dead ends: 11151 [2019-12-07 13:45:10,757 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 13:45:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11151 states. [2019-12-07 13:45:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11151 to 11139. [2019-12-07 13:45:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11139 states. [2019-12-07 13:45:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11139 states to 11139 states and 34447 transitions. [2019-12-07 13:45:10,887 INFO L78 Accepts]: Start accepts. Automaton has 11139 states and 34447 transitions. Word has length 39 [2019-12-07 13:45:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:45:10,887 INFO L462 AbstractCegarLoop]: Abstraction has 11139 states and 34447 transitions. [2019-12-07 13:45:10,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:45:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 11139 states and 34447 transitions. [2019-12-07 13:45:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 13:45:10,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:45:10,896 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] [2019-12-07 13:45:10,896 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:45:10,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:45:10,897 INFO L82 PathProgramCache]: Analyzing trace with hash 654156702, now seen corresponding path program 1 times [2019-12-07 13:45:10,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:45:10,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463230055] [2019-12-07 13:45:10,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:45:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:45:11,125 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 13:45:11,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463230055] [2019-12-07 13:45:11,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:45:11,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:45:11,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182110733] [2019-12-07 13:45:11,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:45:11,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:45:11,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:45:11,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:45:11,126 INFO L87 Difference]: Start difference. First operand 11139 states and 34447 transitions. Second operand 9 states. [2019-12-07 13:45:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:45:12,442 INFO L93 Difference]: Finished difference Result 25723 states and 76648 transitions. [2019-12-07 13:45:12,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 13:45:12,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-12-07 13:45:12,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:45:12,473 INFO L225 Difference]: With dead ends: 25723 [2019-12-07 13:45:12,473 INFO L226 Difference]: Without dead ends: 25079 [2019-12-07 13:45:12,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:45:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25079 states. [2019-12-07 13:45:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25079 to 17316. [2019-12-07 13:45:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17316 states. [2019-12-07 13:45:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17316 states to 17316 states and 53800 transitions. [2019-12-07 13:45:12,775 INFO L78 Accepts]: Start accepts. Automaton has 17316 states and 53800 transitions. Word has length 50 [2019-12-07 13:45:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:45:12,775 INFO L462 AbstractCegarLoop]: Abstraction has 17316 states and 53800 transitions. [2019-12-07 13:45:12,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:45:12,775 INFO L276 IsEmpty]: Start isEmpty. Operand 17316 states and 53800 transitions. [2019-12-07 13:45:12,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 13:45:12,789 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:45:12,790 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] [2019-12-07 13:45:12,790 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:45:12,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:45:12,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1871293106, now seen corresponding path program 2 times [2019-12-07 13:45:12,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:45:12,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464061535] [2019-12-07 13:45:12,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:45:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:45:12,915 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 13:45:12,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464061535] [2019-12-07 13:45:12,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:45:12,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:45:12,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891990845] [2019-12-07 13:45:12,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 13:45:12,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:45:12,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 13:45:12,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:45:12,917 INFO L87 Difference]: Start difference. First operand 17316 states and 53800 transitions. Second operand 11 states. [2019-12-07 13:45:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:45:13,854 INFO L93 Difference]: Finished difference Result 24879 states and 78054 transitions. [2019-12-07 13:45:13,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 13:45:13,855 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-12-07 13:45:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:45:13,881 INFO L225 Difference]: With dead ends: 24879 [2019-12-07 13:45:13,881 INFO L226 Difference]: Without dead ends: 21156 [2019-12-07 13:45:13,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:45:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21156 states. [2019-12-07 13:45:14,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21156 to 13265. [2019-12-07 13:45:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13265 states. [2019-12-07 13:45:14,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13265 states to 13265 states and 41915 transitions. [2019-12-07 13:45:14,113 INFO L78 Accepts]: Start accepts. Automaton has 13265 states and 41915 transitions. Word has length 50 [2019-12-07 13:45:14,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:45:14,113 INFO L462 AbstractCegarLoop]: Abstraction has 13265 states and 41915 transitions. [2019-12-07 13:45:14,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 13:45:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 13265 states and 41915 transitions. [2019-12-07 13:45:14,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 13:45:14,126 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:45:14,126 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] [2019-12-07 13:45:14,126 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:45:14,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:45:14,126 INFO L82 PathProgramCache]: Analyzing trace with hash -583724662, now seen corresponding path program 3 times [2019-12-07 13:45:14,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:45:14,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625504366] [2019-12-07 13:45:14,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:45:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:45:14,177 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 13:45:14,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625504366] [2019-12-07 13:45:14,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:45:14,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:45:14,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846593390] [2019-12-07 13:45:14,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:45:14,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:45:14,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:45:14,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:45:14,178 INFO L87 Difference]: Start difference. First operand 13265 states and 41915 transitions. Second operand 4 states. [2019-12-07 13:45:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:45:14,256 INFO L93 Difference]: Finished difference Result 21210 states and 63383 transitions. [2019-12-07 13:45:14,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:45:14,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 13:45:14,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:45:14,278 INFO L225 Difference]: With dead ends: 21210 [2019-12-07 13:45:14,278 INFO L226 Difference]: Without dead ends: 20737 [2019-12-07 13:45:14,279 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 13:45:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20737 states. [2019-12-07 13:45:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20737 to 13843. [2019-12-07 13:45:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13843 states. [2019-12-07 13:45:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13843 states to 13843 states and 43165 transitions. [2019-12-07 13:45:14,489 INFO L78 Accepts]: Start accepts. Automaton has 13843 states and 43165 transitions. Word has length 50 [2019-12-07 13:45:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:45:14,489 INFO L462 AbstractCegarLoop]: Abstraction has 13843 states and 43165 transitions. [2019-12-07 13:45:14,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:45:14,489 INFO L276 IsEmpty]: Start isEmpty. Operand 13843 states and 43165 transitions. [2019-12-07 13:45:14,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 13:45:14,502 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:45:14,502 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] [2019-12-07 13:45:14,502 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:45:14,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:45:14,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2055850628, now seen corresponding path program 4 times [2019-12-07 13:45:14,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:45:14,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993503913] [2019-12-07 13:45:14,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:45:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:45:14,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 13:45:14,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993503913] [2019-12-07 13:45:14,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:45:14,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:45:14,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601273855] [2019-12-07 13:45:14,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:45:14,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:45:14,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:45:14,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:45:14,553 INFO L87 Difference]: Start difference. First operand 13843 states and 43165 transitions. Second operand 7 states. [2019-12-07 13:45:14,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:45:14,636 INFO L93 Difference]: Finished difference Result 12129 states and 39237 transitions. [2019-12-07 13:45:14,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:45:14,636 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 13:45:14,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:45:14,641 INFO L225 Difference]: With dead ends: 12129 [2019-12-07 13:45:14,641 INFO L226 Difference]: Without dead ends: 3816 [2019-12-07 13:45:14,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:45:14,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2019-12-07 13:45:14,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 3453. [2019-12-07 13:45:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3453 states. [2019-12-07 13:45:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3453 states to 3453 states and 9595 transitions. [2019-12-07 13:45:14,680 INFO L78 Accepts]: Start accepts. Automaton has 3453 states and 9595 transitions. Word has length 50 [2019-12-07 13:45:14,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:45:14,680 INFO L462 AbstractCegarLoop]: Abstraction has 3453 states and 9595 transitions. [2019-12-07 13:45:14,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:45:14,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3453 states and 9595 transitions. [2019-12-07 13:45:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:45:14,683 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:45:14,683 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] [2019-12-07 13:45:14,683 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:45:14,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:45:14,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1388009645, now seen corresponding path program 1 times [2019-12-07 13:45:14,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:45:14,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374506507] [2019-12-07 13:45:14,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:45:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:45:14,760 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 13:45:14,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374506507] [2019-12-07 13:45:14,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:45:14,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:45:14,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992859640] [2019-12-07 13:45:14,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:45:14,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:45:14,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:45:14,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:45:14,761 INFO L87 Difference]: Start difference. First operand 3453 states and 9595 transitions. Second operand 5 states. [2019-12-07 13:45:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:45:14,799 INFO L93 Difference]: Finished difference Result 4192 states and 11606 transitions. [2019-12-07 13:45:14,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:45:14,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 13:45:14,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:45:14,800 INFO L225 Difference]: With dead ends: 4192 [2019-12-07 13:45:14,800 INFO L226 Difference]: Without dead ends: 484 [2019-12-07 13:45:14,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:45:14,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-12-07 13:45:14,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2019-12-07 13:45:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-07 13:45:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1057 transitions. [2019-12-07 13:45:14,804 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1057 transitions. Word has length 65 [2019-12-07 13:45:14,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:45:14,804 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 1057 transitions. [2019-12-07 13:45:14,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:45:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1057 transitions. [2019-12-07 13:45:14,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:45:14,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:45:14,805 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:45:14,805 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:45:14,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:45:14,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1736859180, now seen corresponding path program 1 times [2019-12-07 13:45:14,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:45:14,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517023660] [2019-12-07 13:45:14,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:45:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:45:14,855 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 13:45:14,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517023660] [2019-12-07 13:45:14,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:45:14,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:45:14,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4971141] [2019-12-07 13:45:14,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:45:14,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:45:14,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:45:14,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:45:14,856 INFO L87 Difference]: Start difference. First operand 484 states and 1057 transitions. Second operand 7 states. [2019-12-07 13:45:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:45:14,961 INFO L93 Difference]: Finished difference Result 989 states and 2125 transitions. [2019-12-07 13:45:14,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:45:14,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 13:45:14,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:45:14,962 INFO L225 Difference]: With dead ends: 989 [2019-12-07 13:45:14,962 INFO L226 Difference]: Without dead ends: 738 [2019-12-07 13:45:14,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:45:14,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-07 13:45:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 550. [2019-12-07 13:45:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-12-07 13:45:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1174 transitions. [2019-12-07 13:45:14,967 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1174 transitions. Word has length 66 [2019-12-07 13:45:14,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:45:14,967 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 1174 transitions. [2019-12-07 13:45:14,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:45:14,967 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1174 transitions. [2019-12-07 13:45:14,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:45:14,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:45:14,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:45:14,968 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:45:14,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:45:14,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1869585708, now seen corresponding path program 2 times [2019-12-07 13:45:14,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:45:14,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26387104] [2019-12-07 13:45:14,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:45:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:45:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:45:15,051 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 13:45:15,052 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:45:15,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_86| 0 0))) (and (= v_~z$r_buff0_thd1~0_96 0) (= 0 v_~z$mem_tmp~0_203) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#memory_int_29| (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t141~0.base_40| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t141~0.base_40|) |v_ULTIMATE.start_main_~#t141~0.offset_26| 0))) (= v_~z$r_buff1_thd1~0_165 0) (= v_~main$tmp_guard1~0_48 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t141~0.base_40|) 0) (= 0 v_~z$flush_delayed~0_235) (= 0 v_~__unbuffered_p1_EAX~0_61) (= 0 v_~z$r_buff0_thd4~0_512) (= 0 v_~__unbuffered_p3_EBX~0_56) (= 0 v_~z$r_buff0_thd3~0_418) (= v_~a~0_28 0) (= v_~z$w_buff0_used~0_907 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~weak$$choice2~0_286 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p3_EAX~0_62) (= v_~z$w_buff0~0_341 0) (= v_~y~0_56 0) (= |v_#valid_84| (store .cse0 |v_ULTIMATE.start_main_~#t141~0.base_40| 1)) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t141~0.base_40|) (= 0 v_~__unbuffered_p2_EAX~0_71) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_165 0) (= v_~__unbuffered_p2_EBX~0_75 0) (= v_~z$r_buff1_thd0~0_251 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~z$r_buff0_thd2~0_96 0) (= 0 v_~weak$$choice0~0_191) (= v_~__unbuffered_cnt~0_139 0) (= v_~z$w_buff1~0_234 0) (= v_~x~0_74 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t141~0.base_40| 4) |v_#length_29|) (= v_~z$w_buff1_used~0_667 0) (= v_~z$r_buff1_thd2~0_165 0) (= 0 |v_ULTIMATE.start_main_~#t141~0.offset_26|) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_334) (= v_~z~0_304 0) (= v_~main$tmp_guard0~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t141~0.offset=|v_ULTIMATE.start_main_~#t141~0.offset_26|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_96|, ~a~0=v_~a~0_28, ULTIMATE.start_main_~#t144~0.base=|v_ULTIMATE.start_main_~#t144~0.base_24|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_165, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_61, ULTIMATE.start_main_~#t144~0.offset=|v_ULTIMATE.start_main_~#t144~0.offset_18|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_512, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_62, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ULTIMATE.start_main_~#t141~0.base=|v_ULTIMATE.start_main_~#t141~0.base_40|, ~z$mem_tmp~0=v_~z$mem_tmp~0_203, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_75, ULTIMATE.start_main_~#t142~0.base=|v_ULTIMATE.start_main_~#t142~0.base_32|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_667, ~z$flush_delayed~0=v_~z$flush_delayed~0_235, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_191, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_206|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_165, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_418, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_74, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_334, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t143~0.base=|v_ULTIMATE.start_main_~#t143~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_251, ~y~0=v_~y~0_56, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_96, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_907, ~z$w_buff0~0=v_~z$w_buff0~0_341, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_68|, ULTIMATE.start_main_~#t143~0.offset=|v_ULTIMATE.start_main_~#t143~0.offset_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_37, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_56, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_80|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_97|, ULTIMATE.start_main_~#t142~0.offset=|v_ULTIMATE.start_main_~#t142~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_304, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t141~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ULTIMATE.start_main_~#t144~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t144~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t141~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t142~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t143~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ULTIMATE.start_main_~#t143~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t142~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:45:15,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L856-1-->L858: Formula: (and (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t142~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t142~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t142~0.base_11| 4)) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t142~0.base_11|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t142~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t142~0.offset_10|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t142~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t142~0.base_11|) |v_ULTIMATE.start_main_~#t142~0.offset_10| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t142~0.offset=|v_ULTIMATE.start_main_~#t142~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t142~0.base=|v_ULTIMATE.start_main_~#t142~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t142~0.offset, ULTIMATE.start_main_~#t142~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:45:15,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L858-1-->L860: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t143~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t143~0.base_12| 4)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t143~0.base_12| 1)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t143~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t143~0.base_12|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t143~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t143~0.base_12|) |v_ULTIMATE.start_main_~#t143~0.offset_11| 2))) (not (= |v_ULTIMATE.start_main_~#t143~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t143~0.base=|v_ULTIMATE.start_main_~#t143~0.base_12|, #length=|v_#length_21|, ULTIMATE.start_main_~#t143~0.offset=|v_ULTIMATE.start_main_~#t143~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t143~0.base, #length, ULTIMATE.start_main_~#t143~0.offset] because there is no mapped edge [2019-12-07 13:45:15,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L860-1-->L862: Formula: (and (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t144~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t144~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t144~0.offset_11|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t144~0.base_13|)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t144~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t144~0.base_13|) |v_ULTIMATE.start_main_~#t144~0.offset_11| 3)) |v_#memory_int_23|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t144~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t144~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t144~0.base=|v_ULTIMATE.start_main_~#t144~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t144~0.offset=|v_ULTIMATE.start_main_~#t144~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t144~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, ULTIMATE.start_main_~#t144~0.offset, #length] because there is no mapped edge [2019-12-07 13:45:15,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= 1 v_~z$w_buff0~0_34) (= v_~z$w_buff0~0_35 v_~z$w_buff1~0_22) (= |v_P3Thread1of1ForFork2_#in~arg.offset_9| v_P3Thread1of1ForFork2_~arg.offset_7) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_105 256) 0)) (not (= (mod v_~z$w_buff1_used~0_57 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 0)) (= v_P3Thread1of1ForFork2_~arg.base_7 |v_P3Thread1of1ForFork2_#in~arg.base_9|) (= v_~z$w_buff0_used~0_106 v_~z$w_buff1_used~0_57) (= v_~z$w_buff0_used~0_105 1) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_35, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_7, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_7, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 13:45:15,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-1967332163| |P3Thread1of1ForFork2_#t~ite28_Out-1967332163|)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1967332163 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1967332163 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z$w_buff1~0_In-1967332163 |P3Thread1of1ForFork2_#t~ite28_Out-1967332163|)) (and .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-1967332163| ~z$w_buff0~0_In-1967332163) (not .cse1) (not .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1967332163, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1967332163, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1967332163, ~z$w_buff1~0=~z$w_buff1~0_In-1967332163} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1967332163|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1967332163|, ~z$w_buff0~0=~z$w_buff0~0_In-1967332163, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1967332163, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1967332163, ~z$w_buff1~0=~z$w_buff1~0_In-1967332163} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:45:15,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_105 v_~z$r_buff0_thd4~0_104) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 13:45:15,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1619393664 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out-1619393664| ~z~0_In-1619393664) .cse0) (and (= |P3Thread1of1ForFork2_#t~ite48_Out-1619393664| ~z$mem_tmp~0_In-1619393664) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1619393664, ~z$flush_delayed~0=~z$flush_delayed~0_In-1619393664, ~z~0=~z~0_In-1619393664} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1619393664, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1619393664|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1619393664, ~z~0=~z~0_In-1619393664} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 13:45:15,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_16 1) (= v_~x~0_21 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_16, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 13:45:15,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= v_~x~0_18 2) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~y~0_31 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, ~y~0=v_~y~0_31} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_31, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 13:45:15,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1353282899 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out1353282899| ~z~0_In1353282899)) (and (not .cse0) (= ~z$mem_tmp~0_In1353282899 |P2Thread1of1ForFork1_#t~ite25_Out1353282899|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1353282899, ~z$flush_delayed~0=~z$flush_delayed~0_In1353282899, ~z~0=~z~0_In1353282899} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1353282899, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out1353282899|, ~z$flush_delayed~0=~z$flush_delayed~0_In1353282899, ~z~0=~z~0_In1353282899} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 13:45:15,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1806181958 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1806181958 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out-1806181958| 0) (not .cse1)) (and (= |P3Thread1of1ForFork2_#t~ite51_Out-1806181958| ~z$w_buff0_used~0_In-1806181958) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1806181958, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1806181958} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1806181958|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1806181958, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1806181958} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 13:45:15,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-91441583 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-91441583 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-91441583 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-91441583 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out-91441583| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-91441583 |P3Thread1of1ForFork2_#t~ite52_Out-91441583|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-91441583, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-91441583, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-91441583, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-91441583} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-91441583|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-91441583, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-91441583, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-91441583, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-91441583} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 13:45:15,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out-733514122 ~z$r_buff0_thd4~0_In-733514122)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-733514122 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-733514122 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-733514122) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-733514122, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-733514122} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-733514122|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-733514122, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-733514122} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 13:45:15,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In-664869230 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-664869230 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-664869230 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-664869230 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite54_Out-664869230| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P3Thread1of1ForFork2_#t~ite54_Out-664869230| ~z$r_buff1_thd4~0_In-664869230)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-664869230, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-664869230, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-664869230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-664869230} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-664869230|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-664869230, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-664869230, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-664869230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-664869230} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 13:45:15,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L837-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_30| v_~z$r_buff1_thd4~0_260) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_29|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:45:15,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_189) (= v_~z~0_189 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_189, ~z~0=v_~z~0_189, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 13:45:15,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_107 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:45:15,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out639777418| |ULTIMATE.start_main_#t~ite60_Out639777418|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In639777418 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In639777418 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite59_Out639777418| ~z$w_buff1~0_In639777418) (not .cse1) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite59_Out639777418| ~z~0_In639777418) (or .cse1 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In639777418, ~z$w_buff1_used~0=~z$w_buff1_used~0_In639777418, ~z$w_buff1~0=~z$w_buff1~0_In639777418, ~z~0=~z~0_In639777418} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out639777418|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In639777418, ~z$w_buff1_used~0=~z$w_buff1_used~0_In639777418, ~z$w_buff1~0=~z$w_buff1~0_In639777418, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out639777418|, ~z~0=~z~0_In639777418} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 13:45:15,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In671874185 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In671874185 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out671874185|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite61_Out671874185| ~z$w_buff0_used~0_In671874185)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In671874185, ~z$w_buff0_used~0=~z$w_buff0_used~0_In671874185} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In671874185, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out671874185|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In671874185} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 13:45:15,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In2010509751 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2010509751 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2010509751 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2010509751 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out2010509751|)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2010509751 |ULTIMATE.start_main_#t~ite62_Out2010509751|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2010509751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2010509751, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2010509751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2010509751} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2010509751|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2010509751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2010509751, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2010509751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2010509751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 13:45:15,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1197094227 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1197094227 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out1197094227| ~z$r_buff0_thd0~0_In1197094227) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out1197094227|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1197094227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1197094227} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1197094227|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1197094227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1197094227} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 13:45:15,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1927376317 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1927376317 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1927376317 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1927376317 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-1927376317 |ULTIMATE.start_main_#t~ite64_Out-1927376317|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite64_Out-1927376317|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1927376317, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1927376317, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1927376317, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1927376317} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1927376317, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1927376317, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1927376317, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1927376317, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1927376317|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 13:45:15,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_18 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_27) (= 1 v_~__unbuffered_p2_EAX~0_41) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EBX~0_43 0) (= v_~x~0_36 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_18) (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite64_41|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:45:15,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:45:15 BasicIcfg [2019-12-07 13:45:15,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:45:15,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:45:15,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:45:15,159 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:45:15,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:43:30" (3/4) ... [2019-12-07 13:45:15,162 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:45:15,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_86| 0 0))) (and (= v_~z$r_buff0_thd1~0_96 0) (= 0 v_~z$mem_tmp~0_203) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#memory_int_29| (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t141~0.base_40| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t141~0.base_40|) |v_ULTIMATE.start_main_~#t141~0.offset_26| 0))) (= v_~z$r_buff1_thd1~0_165 0) (= v_~main$tmp_guard1~0_48 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t141~0.base_40|) 0) (= 0 v_~z$flush_delayed~0_235) (= 0 v_~__unbuffered_p1_EAX~0_61) (= 0 v_~z$r_buff0_thd4~0_512) (= 0 v_~__unbuffered_p3_EBX~0_56) (= 0 v_~z$r_buff0_thd3~0_418) (= v_~a~0_28 0) (= v_~z$w_buff0_used~0_907 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~weak$$choice2~0_286 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p3_EAX~0_62) (= v_~z$w_buff0~0_341 0) (= v_~y~0_56 0) (= |v_#valid_84| (store .cse0 |v_ULTIMATE.start_main_~#t141~0.base_40| 1)) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t141~0.base_40|) (= 0 v_~__unbuffered_p2_EAX~0_71) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_165 0) (= v_~__unbuffered_p2_EBX~0_75 0) (= v_~z$r_buff1_thd0~0_251 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~z$r_buff0_thd2~0_96 0) (= 0 v_~weak$$choice0~0_191) (= v_~__unbuffered_cnt~0_139 0) (= v_~z$w_buff1~0_234 0) (= v_~x~0_74 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t141~0.base_40| 4) |v_#length_29|) (= v_~z$w_buff1_used~0_667 0) (= v_~z$r_buff1_thd2~0_165 0) (= 0 |v_ULTIMATE.start_main_~#t141~0.offset_26|) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_334) (= v_~z~0_304 0) (= v_~main$tmp_guard0~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t141~0.offset=|v_ULTIMATE.start_main_~#t141~0.offset_26|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_96|, ~a~0=v_~a~0_28, ULTIMATE.start_main_~#t144~0.base=|v_ULTIMATE.start_main_~#t144~0.base_24|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_165, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_61, ULTIMATE.start_main_~#t144~0.offset=|v_ULTIMATE.start_main_~#t144~0.offset_18|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_512, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_62, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ULTIMATE.start_main_~#t141~0.base=|v_ULTIMATE.start_main_~#t141~0.base_40|, ~z$mem_tmp~0=v_~z$mem_tmp~0_203, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_75, ULTIMATE.start_main_~#t142~0.base=|v_ULTIMATE.start_main_~#t142~0.base_32|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_667, ~z$flush_delayed~0=v_~z$flush_delayed~0_235, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_191, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_206|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_165, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_418, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_74, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_334, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t143~0.base=|v_ULTIMATE.start_main_~#t143~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_251, ~y~0=v_~y~0_56, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_96, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_907, ~z$w_buff0~0=v_~z$w_buff0~0_341, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_68|, ULTIMATE.start_main_~#t143~0.offset=|v_ULTIMATE.start_main_~#t143~0.offset_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_37, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_56, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_80|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_97|, ULTIMATE.start_main_~#t142~0.offset=|v_ULTIMATE.start_main_~#t142~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_304, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t141~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ULTIMATE.start_main_~#t144~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t144~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t141~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t142~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t143~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ULTIMATE.start_main_~#t143~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t142~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:45:15,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L856-1-->L858: Formula: (and (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t142~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t142~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t142~0.base_11| 4)) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t142~0.base_11|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t142~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t142~0.offset_10|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t142~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t142~0.base_11|) |v_ULTIMATE.start_main_~#t142~0.offset_10| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t142~0.offset=|v_ULTIMATE.start_main_~#t142~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t142~0.base=|v_ULTIMATE.start_main_~#t142~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t142~0.offset, ULTIMATE.start_main_~#t142~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:45:15,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L858-1-->L860: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t143~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t143~0.base_12| 4)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t143~0.base_12| 1)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t143~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t143~0.base_12|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t143~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t143~0.base_12|) |v_ULTIMATE.start_main_~#t143~0.offset_11| 2))) (not (= |v_ULTIMATE.start_main_~#t143~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t143~0.base=|v_ULTIMATE.start_main_~#t143~0.base_12|, #length=|v_#length_21|, ULTIMATE.start_main_~#t143~0.offset=|v_ULTIMATE.start_main_~#t143~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t143~0.base, #length, ULTIMATE.start_main_~#t143~0.offset] because there is no mapped edge [2019-12-07 13:45:15,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L860-1-->L862: Formula: (and (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t144~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t144~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t144~0.offset_11|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t144~0.base_13|)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t144~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t144~0.base_13|) |v_ULTIMATE.start_main_~#t144~0.offset_11| 3)) |v_#memory_int_23|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t144~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t144~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t144~0.base=|v_ULTIMATE.start_main_~#t144~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t144~0.offset=|v_ULTIMATE.start_main_~#t144~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t144~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, ULTIMATE.start_main_~#t144~0.offset, #length] because there is no mapped edge [2019-12-07 13:45:15,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= 1 v_~z$w_buff0~0_34) (= v_~z$w_buff0~0_35 v_~z$w_buff1~0_22) (= |v_P3Thread1of1ForFork2_#in~arg.offset_9| v_P3Thread1of1ForFork2_~arg.offset_7) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_105 256) 0)) (not (= (mod v_~z$w_buff1_used~0_57 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 0)) (= v_P3Thread1of1ForFork2_~arg.base_7 |v_P3Thread1of1ForFork2_#in~arg.base_9|) (= v_~z$w_buff0_used~0_106 v_~z$w_buff1_used~0_57) (= v_~z$w_buff0_used~0_105 1) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_35, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_7, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_7, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 13:45:15,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-1967332163| |P3Thread1of1ForFork2_#t~ite28_Out-1967332163|)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1967332163 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1967332163 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z$w_buff1~0_In-1967332163 |P3Thread1of1ForFork2_#t~ite28_Out-1967332163|)) (and .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-1967332163| ~z$w_buff0~0_In-1967332163) (not .cse1) (not .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1967332163, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1967332163, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1967332163, ~z$w_buff1~0=~z$w_buff1~0_In-1967332163} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1967332163|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1967332163|, ~z$w_buff0~0=~z$w_buff0~0_In-1967332163, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1967332163, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1967332163, ~z$w_buff1~0=~z$w_buff1~0_In-1967332163} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:45:15,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_105 v_~z$r_buff0_thd4~0_104) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 13:45:15,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1619393664 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out-1619393664| ~z~0_In-1619393664) .cse0) (and (= |P3Thread1of1ForFork2_#t~ite48_Out-1619393664| ~z$mem_tmp~0_In-1619393664) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1619393664, ~z$flush_delayed~0=~z$flush_delayed~0_In-1619393664, ~z~0=~z~0_In-1619393664} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1619393664, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1619393664|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1619393664, ~z~0=~z~0_In-1619393664} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 13:45:15,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_16 1) (= v_~x~0_21 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_16, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 13:45:15,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= v_~x~0_18 2) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~y~0_31 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, ~y~0=v_~y~0_31} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_31, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 13:45:15,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1353282899 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out1353282899| ~z~0_In1353282899)) (and (not .cse0) (= ~z$mem_tmp~0_In1353282899 |P2Thread1of1ForFork1_#t~ite25_Out1353282899|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1353282899, ~z$flush_delayed~0=~z$flush_delayed~0_In1353282899, ~z~0=~z~0_In1353282899} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1353282899, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out1353282899|, ~z$flush_delayed~0=~z$flush_delayed~0_In1353282899, ~z~0=~z~0_In1353282899} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 13:45:15,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1806181958 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1806181958 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out-1806181958| 0) (not .cse1)) (and (= |P3Thread1of1ForFork2_#t~ite51_Out-1806181958| ~z$w_buff0_used~0_In-1806181958) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1806181958, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1806181958} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1806181958|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1806181958, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1806181958} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 13:45:15,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-91441583 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-91441583 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-91441583 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-91441583 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out-91441583| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-91441583 |P3Thread1of1ForFork2_#t~ite52_Out-91441583|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-91441583, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-91441583, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-91441583, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-91441583} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-91441583|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-91441583, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-91441583, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-91441583, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-91441583} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 13:45:15,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out-733514122 ~z$r_buff0_thd4~0_In-733514122)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-733514122 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-733514122 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-733514122) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-733514122, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-733514122} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-733514122|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-733514122, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-733514122} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 13:45:15,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In-664869230 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-664869230 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-664869230 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-664869230 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite54_Out-664869230| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P3Thread1of1ForFork2_#t~ite54_Out-664869230| ~z$r_buff1_thd4~0_In-664869230)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-664869230, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-664869230, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-664869230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-664869230} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-664869230|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-664869230, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-664869230, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-664869230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-664869230} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 13:45:15,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L837-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_30| v_~z$r_buff1_thd4~0_260) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_29|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:45:15,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_189) (= v_~z~0_189 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_189, ~z~0=v_~z~0_189, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 13:45:15,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_107 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:45:15,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out639777418| |ULTIMATE.start_main_#t~ite60_Out639777418|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In639777418 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In639777418 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite59_Out639777418| ~z$w_buff1~0_In639777418) (not .cse1) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite59_Out639777418| ~z~0_In639777418) (or .cse1 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In639777418, ~z$w_buff1_used~0=~z$w_buff1_used~0_In639777418, ~z$w_buff1~0=~z$w_buff1~0_In639777418, ~z~0=~z~0_In639777418} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out639777418|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In639777418, ~z$w_buff1_used~0=~z$w_buff1_used~0_In639777418, ~z$w_buff1~0=~z$w_buff1~0_In639777418, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out639777418|, ~z~0=~z~0_In639777418} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 13:45:15,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In671874185 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In671874185 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out671874185|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite61_Out671874185| ~z$w_buff0_used~0_In671874185)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In671874185, ~z$w_buff0_used~0=~z$w_buff0_used~0_In671874185} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In671874185, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out671874185|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In671874185} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 13:45:15,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In2010509751 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2010509751 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2010509751 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2010509751 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out2010509751|)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2010509751 |ULTIMATE.start_main_#t~ite62_Out2010509751|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2010509751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2010509751, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2010509751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2010509751} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2010509751|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2010509751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2010509751, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2010509751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2010509751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 13:45:15,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1197094227 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1197094227 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out1197094227| ~z$r_buff0_thd0~0_In1197094227) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out1197094227|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1197094227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1197094227} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1197094227|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1197094227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1197094227} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 13:45:15,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1927376317 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1927376317 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1927376317 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1927376317 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-1927376317 |ULTIMATE.start_main_#t~ite64_Out-1927376317|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite64_Out-1927376317|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1927376317, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1927376317, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1927376317, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1927376317} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1927376317, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1927376317, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1927376317, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1927376317, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1927376317|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 13:45:15,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_18 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_27) (= 1 v_~__unbuffered_p2_EAX~0_41) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EBX~0_43 0) (= v_~x~0_36 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_18) (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite64_41|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:45:15,257 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_aca4bd16-5196-493c-ac4b-af4b940c0cfe/bin/utaipan/witness.graphml [2019-12-07 13:45:15,257 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:45:15,259 INFO L168 Benchmark]: Toolchain (without parser) took 105470.21 ms. Allocated memory was 1.0 GB in the beginning and 7.2 GB in the end (delta: 6.2 GB). Free memory was 939.8 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-12-07 13:45:15,259 INFO L168 Benchmark]: CDTParser took 0.14 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 13:45:15,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -142.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:45:15,259 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:45:15,260 INFO L168 Benchmark]: Boogie Preprocessor took 27.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:45:15,260 INFO L168 Benchmark]: RCFGBuilder took 438.60 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: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:45:15,260 INFO L168 Benchmark]: TraceAbstraction took 104472.72 ms. Allocated memory was 1.1 GB in the beginning and 7.2 GB in the end (delta: 6.0 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-12-07 13:45:15,261 INFO L168 Benchmark]: Witness Printer took 98.04 ms. Allocated memory is still 7.2 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 67.1 MB). Peak memory consumption was 67.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:45:15,263 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -142.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 438.60 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: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 104472.72 ms. Allocated memory was 1.1 GB in the beginning and 7.2 GB in the end (delta: 6.0 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 98.04 ms. Allocated memory is still 7.2 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 67.1 MB). Peak memory consumption was 67.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 212 ProgramPointsBefore, 112 ProgramPointsAfterwards, 255 TransitionsBefore, 132 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 28 ChoiceCompositions, 11185 VarBasedMoverChecksPositive, 319 VarBasedMoverChecksNegative, 81 SemBasedMoverChecksPositive, 338 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 141939 CheckedPairsTotal, 133 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t141, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t142, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t143, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t144, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 __unbuffered_p2_EAX = y [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 104.2s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5066 SDtfs, 7989 SDslu, 12268 SDs, 0 SdLazy, 5668 SolverSat, 277 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204643occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 61.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 223649 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 817 NumberOfCodeBlocks, 817 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 729 ConstructedInterpolants, 0 QuantifiedInterpolants, 237129 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...