./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_tso.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_9a6446fc-a21f-4be0-99e4-861c0e2e8575/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9a6446fc-a21f-4be0-99e4-861c0e2e8575/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9a6446fc-a21f-4be0-99e4-861c0e2e8575/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9a6446fc-a21f-4be0-99e4-861c0e2e8575/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9a6446fc-a21f-4be0-99e4-861c0e2e8575/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9a6446fc-a21f-4be0-99e4-861c0e2e8575/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 b5fb09239e9455704e0f9d0393a002e01006e03b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 16:30:38,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:30:38,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:30:38,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:30:38,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:30:38,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:30:38,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:30:38,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:30:38,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:30:38,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:30:38,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:30:38,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:30:38,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:30:38,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:30:38,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:30:38,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:30:38,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:30:38,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:30:38,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:30:38,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:30:38,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:30:38,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:30:38,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:30:38,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:30:38,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:30:38,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:30:38,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:30:38,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:30:38,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:30:38,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:30:38,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:30:38,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:30:38,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:30:38,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:30:38,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:30:38,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:30:38,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:30:38,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:30:38,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:30:38,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:30:38,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:30:38,968 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9a6446fc-a21f-4be0-99e4-861c0e2e8575/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:30:38,981 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:30:38,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:30:38,982 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:30:38,982 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:30:38,982 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:30:38,982 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:30:38,982 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:30:38,983 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:30:38,983 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:30:38,983 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:30:38,983 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:30:38,983 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:30:38,984 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:30:38,984 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:30:38,984 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:30:38,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:30:38,985 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:30:38,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:30:38,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:30:38,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:30:38,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:30:38,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:30:38,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:30:38,986 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:30:38,986 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:30:38,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:30:38,987 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:30:38,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:30:38,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:30:38,987 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:30:38,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:30:38,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:30:38,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:30:38,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:30:38,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:30:38,988 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:30:38,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:30:38,989 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:30:38,989 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:30:38,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:30:38,989 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_9a6446fc-a21f-4be0-99e4-861c0e2e8575/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 -> b5fb09239e9455704e0f9d0393a002e01006e03b [2019-12-07 16:30:39,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:30:39,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:30:39,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:30:39,102 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:30:39,102 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:30:39,103 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9a6446fc-a21f-4be0-99e4-861c0e2e8575/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix011_tso.opt.i [2019-12-07 16:30:39,141 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9a6446fc-a21f-4be0-99e4-861c0e2e8575/bin/utaipan/data/71e4e36b2/85a61c769dd4424688abd11f55bc1edf/FLAGce5e05a24 [2019-12-07 16:30:39,495 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:30:39,496 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9a6446fc-a21f-4be0-99e4-861c0e2e8575/sv-benchmarks/c/pthread-wmm/mix011_tso.opt.i [2019-12-07 16:30:39,506 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9a6446fc-a21f-4be0-99e4-861c0e2e8575/bin/utaipan/data/71e4e36b2/85a61c769dd4424688abd11f55bc1edf/FLAGce5e05a24 [2019-12-07 16:30:39,516 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9a6446fc-a21f-4be0-99e4-861c0e2e8575/bin/utaipan/data/71e4e36b2/85a61c769dd4424688abd11f55bc1edf [2019-12-07 16:30:39,518 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:30:39,519 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:30:39,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:30:39,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:30:39,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:30:39,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:30:39" (1/1) ... [2019-12-07 16:30:39,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6199d303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:30:39, skipping insertion in model container [2019-12-07 16:30:39,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:30:39" (1/1) ... [2019-12-07 16:30:39,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:30:39,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:30:39,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:30:39,841 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:30:39,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:30:39,935 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:30:39,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:30:39 WrapperNode [2019-12-07 16:30:39,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:30:39,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:30:39,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:30:39,936 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:30:39,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:30:39" (1/1) ... [2019-12-07 16:30:39,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:30:39" (1/1) ... [2019-12-07 16:30:39,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:30:39,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:30:39,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:30:39,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:30:39,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:30:39" (1/1) ... [2019-12-07 16:30:39,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:30:39" (1/1) ... [2019-12-07 16:30:39,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:30:39" (1/1) ... [2019-12-07 16:30:39,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:30:39" (1/1) ... [2019-12-07 16:30:39,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:30:39" (1/1) ... [2019-12-07 16:30:40,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:30:39" (1/1) ... [2019-12-07 16:30:40,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:30:39" (1/1) ... [2019-12-07 16:30:40,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:30:40,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:30:40,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:30:40,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:30:40,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:30:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a6446fc-a21f-4be0-99e4-861c0e2e8575/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 16:30:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:30:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:30:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:30:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:30:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:30:40,053 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:30:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:30:40,053 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:30:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 16:30:40,053 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 16:30:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:30:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:30:40,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:30:40,055 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 16:30:40,455 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:30:40,456 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:30:40,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:30:40 BoogieIcfgContainer [2019-12-07 16:30:40,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:30:40,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:30:40,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:30:40,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:30:40,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:30:39" (1/3) ... [2019-12-07 16:30:40,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ce8905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:30:40, skipping insertion in model container [2019-12-07 16:30:40,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:30:39" (2/3) ... [2019-12-07 16:30:40,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ce8905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:30:40, skipping insertion in model container [2019-12-07 16:30:40,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:30:40" (3/3) ... [2019-12-07 16:30:40,463 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_tso.opt.i [2019-12-07 16:30:40,472 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:30:40,472 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:30:40,478 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:30:40,479 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:30:40,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,518 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,519 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,520 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,521 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,537 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,537 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,537 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,537 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,537 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:30:40,571 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 16:30:40,586 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:30:40,586 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:30:40,586 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:30:40,586 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:30:40,586 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:30:40,586 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:30:40,587 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:30:40,587 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:30:40,601 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-12-07 16:30:40,603 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-07 16:30:40,683 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-07 16:30:40,683 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:30:40,695 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 909 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 16:30:40,717 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-07 16:30:40,765 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-07 16:30:40,765 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:30:40,774 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 909 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 16:30:40,799 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 16:30:40,799 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:30:44,034 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-12-07 16:30:44,339 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 16:30:44,685 INFO L206 etLargeBlockEncoding]: Checked pairs total: 115591 [2019-12-07 16:30:44,685 INFO L214 etLargeBlockEncoding]: Total number of compositions: 128 [2019-12-07 16:30:44,687 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 122 transitions [2019-12-07 16:30:47,110 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39870 states. [2019-12-07 16:30:47,111 INFO L276 IsEmpty]: Start isEmpty. Operand 39870 states. [2019-12-07 16:30:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 16:30:47,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:47,116 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:47,116 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:47,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:47,119 INFO L82 PathProgramCache]: Analyzing trace with hash 191430122, now seen corresponding path program 1 times [2019-12-07 16:30:47,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:30:47,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863886108] [2019-12-07 16:30:47,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:30:47,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863886108] [2019-12-07 16:30:47,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:30:47,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:30:47,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563899906] [2019-12-07 16:30:47,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:30:47,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:30:47,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:30:47,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:30:47,282 INFO L87 Difference]: Start difference. First operand 39870 states. Second operand 3 states. [2019-12-07 16:30:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:47,701 INFO L93 Difference]: Finished difference Result 39574 states and 160408 transitions. [2019-12-07 16:30:47,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:30:47,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 16:30:47,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:47,936 INFO L225 Difference]: With dead ends: 39574 [2019-12-07 16:30:47,936 INFO L226 Difference]: Without dead ends: 36868 [2019-12-07 16:30:47,937 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 16:30:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36868 states. [2019-12-07 16:30:49,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36868 to 36868. [2019-12-07 16:30:49,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36868 states. [2019-12-07 16:30:49,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36868 states to 36868 states and 149325 transitions. [2019-12-07 16:30:49,250 INFO L78 Accepts]: Start accepts. Automaton has 36868 states and 149325 transitions. Word has length 7 [2019-12-07 16:30:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:49,251 INFO L462 AbstractCegarLoop]: Abstraction has 36868 states and 149325 transitions. [2019-12-07 16:30:49,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:30:49,251 INFO L276 IsEmpty]: Start isEmpty. Operand 36868 states and 149325 transitions. [2019-12-07 16:30:49,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:30:49,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:49,255 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:49,255 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:49,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:49,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1210424527, now seen corresponding path program 1 times [2019-12-07 16:30:49,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:30:49,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304173363] [2019-12-07 16:30:49,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:49,321 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 16:30:49,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304173363] [2019-12-07 16:30:49,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:30:49,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:30:49,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143232933] [2019-12-07 16:30:49,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:30:49,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:30:49,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:30:49,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:30:49,324 INFO L87 Difference]: Start difference. First operand 36868 states and 149325 transitions. Second operand 4 states. [2019-12-07 16:30:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:49,475 INFO L93 Difference]: Finished difference Result 23583 states and 83510 transitions. [2019-12-07 16:30:49,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:30:49,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 16:30:49,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:49,599 INFO L225 Difference]: With dead ends: 23583 [2019-12-07 16:30:49,599 INFO L226 Difference]: Without dead ends: 20877 [2019-12-07 16:30:49,599 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 16:30:49,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20877 states. [2019-12-07 16:30:50,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20877 to 20877. [2019-12-07 16:30:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20877 states. [2019-12-07 16:30:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20877 states to 20877 states and 73863 transitions. [2019-12-07 16:30:50,227 INFO L78 Accepts]: Start accepts. Automaton has 20877 states and 73863 transitions. Word has length 13 [2019-12-07 16:30:50,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:50,227 INFO L462 AbstractCegarLoop]: Abstraction has 20877 states and 73863 transitions. [2019-12-07 16:30:50,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:30:50,227 INFO L276 IsEmpty]: Start isEmpty. Operand 20877 states and 73863 transitions. [2019-12-07 16:30:50,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:30:50,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:50,229 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:50,229 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:50,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:50,229 INFO L82 PathProgramCache]: Analyzing trace with hash -683536690, now seen corresponding path program 1 times [2019-12-07 16:30:50,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:30:50,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441423831] [2019-12-07 16:30:50,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:50,279 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 16:30:50,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441423831] [2019-12-07 16:30:50,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:30:50,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:30:50,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742081961] [2019-12-07 16:30:50,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:30:50,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:30:50,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:30:50,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:30:50,280 INFO L87 Difference]: Start difference. First operand 20877 states and 73863 transitions. Second operand 4 states. [2019-12-07 16:30:50,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:50,545 INFO L93 Difference]: Finished difference Result 31787 states and 108416 transitions. [2019-12-07 16:30:50,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:30:50,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 16:30:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:50,597 INFO L225 Difference]: With dead ends: 31787 [2019-12-07 16:30:50,597 INFO L226 Difference]: Without dead ends: 31772 [2019-12-07 16:30:50,597 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 16:30:50,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31772 states. [2019-12-07 16:30:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31772 to 30600. [2019-12-07 16:30:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30600 states. [2019-12-07 16:30:51,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30600 states to 30600 states and 105187 transitions. [2019-12-07 16:30:51,388 INFO L78 Accepts]: Start accepts. Automaton has 30600 states and 105187 transitions. Word has length 14 [2019-12-07 16:30:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:51,388 INFO L462 AbstractCegarLoop]: Abstraction has 30600 states and 105187 transitions. [2019-12-07 16:30:51,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:30:51,388 INFO L276 IsEmpty]: Start isEmpty. Operand 30600 states and 105187 transitions. [2019-12-07 16:30:51,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:30:51,390 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:51,390 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:51,390 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:51,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:51,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2049494264, now seen corresponding path program 1 times [2019-12-07 16:30:51,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:30:51,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528982344] [2019-12-07 16:30:51,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:51,426 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 16:30:51,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528982344] [2019-12-07 16:30:51,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:30:51,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:30:51,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038535545] [2019-12-07 16:30:51,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:30:51,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:30:51,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:30:51,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:30:51,428 INFO L87 Difference]: Start difference. First operand 30600 states and 105187 transitions. Second operand 4 states. [2019-12-07 16:30:51,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:51,690 INFO L93 Difference]: Finished difference Result 40226 states and 135997 transitions. [2019-12-07 16:30:51,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:30:51,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 16:30:51,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:51,758 INFO L225 Difference]: With dead ends: 40226 [2019-12-07 16:30:51,758 INFO L226 Difference]: Without dead ends: 40157 [2019-12-07 16:30:51,758 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 16:30:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40157 states. [2019-12-07 16:30:52,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40157 to 35465. [2019-12-07 16:30:52,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2019-12-07 16:30:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 121322 transitions. [2019-12-07 16:30:52,592 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 121322 transitions. Word has length 16 [2019-12-07 16:30:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:52,592 INFO L462 AbstractCegarLoop]: Abstraction has 35465 states and 121322 transitions. [2019-12-07 16:30:52,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:30:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 121322 transitions. [2019-12-07 16:30:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:30:52,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:52,596 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:52,596 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:52,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:52,597 INFO L82 PathProgramCache]: Analyzing trace with hash -883448571, now seen corresponding path program 1 times [2019-12-07 16:30:52,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:30:52,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034873597] [2019-12-07 16:30:52,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:52,654 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 16:30:52,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034873597] [2019-12-07 16:30:52,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:30:52,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:30:52,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764739611] [2019-12-07 16:30:52,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:30:52,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:30:52,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:30:52,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:30:52,656 INFO L87 Difference]: Start difference. First operand 35465 states and 121322 transitions. Second operand 4 states. [2019-12-07 16:30:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:52,788 INFO L93 Difference]: Finished difference Result 40195 states and 136110 transitions. [2019-12-07 16:30:52,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:30:52,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 16:30:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:52,846 INFO L225 Difference]: With dead ends: 40195 [2019-12-07 16:30:52,846 INFO L226 Difference]: Without dead ends: 39721 [2019-12-07 16:30:52,846 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 16:30:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39721 states. [2019-12-07 16:30:53,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39721 to 39669. [2019-12-07 16:30:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39669 states. [2019-12-07 16:30:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39669 states to 39669 states and 134561 transitions. [2019-12-07 16:30:53,615 INFO L78 Accepts]: Start accepts. Automaton has 39669 states and 134561 transitions. Word has length 19 [2019-12-07 16:30:53,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:53,616 INFO L462 AbstractCegarLoop]: Abstraction has 39669 states and 134561 transitions. [2019-12-07 16:30:53,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:30:53,616 INFO L276 IsEmpty]: Start isEmpty. Operand 39669 states and 134561 transitions. [2019-12-07 16:30:53,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:30:53,624 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:53,624 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] [2019-12-07 16:30:53,624 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:53,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:53,625 INFO L82 PathProgramCache]: Analyzing trace with hash 689626834, now seen corresponding path program 1 times [2019-12-07 16:30:53,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:30:53,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134774764] [2019-12-07 16:30:53,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:53,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 16:30:53,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134774764] [2019-12-07 16:30:53,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:30:53,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:30:53,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509538214] [2019-12-07 16:30:53,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:30:53,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:30:53,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:30:53,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:30:53,781 INFO L87 Difference]: Start difference. First operand 39669 states and 134561 transitions. Second operand 5 states. [2019-12-07 16:30:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:54,206 INFO L93 Difference]: Finished difference Result 47678 states and 159199 transitions. [2019-12-07 16:30:54,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:30:54,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 16:30:54,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:54,274 INFO L225 Difference]: With dead ends: 47678 [2019-12-07 16:30:54,274 INFO L226 Difference]: Without dead ends: 47650 [2019-12-07 16:30:54,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:30:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47650 states. [2019-12-07 16:30:55,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47650 to 39962. [2019-12-07 16:30:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39962 states. [2019-12-07 16:30:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39962 states to 39962 states and 135464 transitions. [2019-12-07 16:30:55,124 INFO L78 Accepts]: Start accepts. Automaton has 39962 states and 135464 transitions. Word has length 23 [2019-12-07 16:30:55,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:55,124 INFO L462 AbstractCegarLoop]: Abstraction has 39962 states and 135464 transitions. [2019-12-07 16:30:55,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:30:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 39962 states and 135464 transitions. [2019-12-07 16:30:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 16:30:55,152 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:55,152 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:55,152 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:55,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:55,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1549433753, now seen corresponding path program 1 times [2019-12-07 16:30:55,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:30:55,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483492039] [2019-12-07 16:30:55,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:55,205 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 16:30:55,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483492039] [2019-12-07 16:30:55,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:30:55,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:30:55,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437083040] [2019-12-07 16:30:55,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:30:55,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:30:55,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:30:55,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:30:55,207 INFO L87 Difference]: Start difference. First operand 39962 states and 135464 transitions. Second operand 4 states. [2019-12-07 16:30:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:55,447 INFO L93 Difference]: Finished difference Result 60332 states and 206955 transitions. [2019-12-07 16:30:55,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:30:55,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 16:30:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:55,544 INFO L225 Difference]: With dead ends: 60332 [2019-12-07 16:30:55,544 INFO L226 Difference]: Without dead ends: 60332 [2019-12-07 16:30:55,545 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 16:30:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60332 states. [2019-12-07 16:30:56,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60332 to 39779. [2019-12-07 16:30:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39779 states. [2019-12-07 16:30:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39779 states to 39779 states and 134916 transitions. [2019-12-07 16:30:56,492 INFO L78 Accepts]: Start accepts. Automaton has 39779 states and 134916 transitions. Word has length 33 [2019-12-07 16:30:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:56,493 INFO L462 AbstractCegarLoop]: Abstraction has 39779 states and 134916 transitions. [2019-12-07 16:30:56,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:30:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 39779 states and 134916 transitions. [2019-12-07 16:30:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 16:30:56,522 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:56,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:56,522 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:56,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:56,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1346675898, now seen corresponding path program 1 times [2019-12-07 16:30:56,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:30:56,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696397991] [2019-12-07 16:30:56,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:56,561 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 16:30:56,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696397991] [2019-12-07 16:30:56,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:30:56,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:30:56,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929336131] [2019-12-07 16:30:56,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:30:56,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:30:56,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:30:56,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:30:56,562 INFO L87 Difference]: Start difference. First operand 39779 states and 134916 transitions. Second operand 3 states. [2019-12-07 16:30:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:56,678 INFO L93 Difference]: Finished difference Result 39779 states and 133052 transitions. [2019-12-07 16:30:56,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:30:56,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 16:30:56,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:56,733 INFO L225 Difference]: With dead ends: 39779 [2019-12-07 16:30:56,734 INFO L226 Difference]: Without dead ends: 39779 [2019-12-07 16:30:56,734 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 16:30:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39779 states. [2019-12-07 16:30:57,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39779 to 39422. [2019-12-07 16:30:57,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39422 states. [2019-12-07 16:30:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39422 states to 39422 states and 132020 transitions. [2019-12-07 16:30:57,530 INFO L78 Accepts]: Start accepts. Automaton has 39422 states and 132020 transitions. Word has length 34 [2019-12-07 16:30:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:57,530 INFO L462 AbstractCegarLoop]: Abstraction has 39422 states and 132020 transitions. [2019-12-07 16:30:57,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:30:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 39422 states and 132020 transitions. [2019-12-07 16:30:57,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 16:30:57,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:57,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:57,559 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:57,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:57,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1911024769, now seen corresponding path program 1 times [2019-12-07 16:30:57,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:30:57,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961754899] [2019-12-07 16:30:57,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:57,616 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 16:30:57,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961754899] [2019-12-07 16:30:57,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:30:57,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:30:57,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282346370] [2019-12-07 16:30:57,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:30:57,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:30:57,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:30:57,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:30:57,618 INFO L87 Difference]: Start difference. First operand 39422 states and 132020 transitions. Second operand 8 states. [2019-12-07 16:30:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:58,134 INFO L93 Difference]: Finished difference Result 86221 states and 288083 transitions. [2019-12-07 16:30:58,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 16:30:58,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-07 16:30:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:58,243 INFO L225 Difference]: With dead ends: 86221 [2019-12-07 16:30:58,243 INFO L226 Difference]: Without dead ends: 67261 [2019-12-07 16:30:58,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:30:58,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67261 states. [2019-12-07 16:30:59,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67261 to 59913. [2019-12-07 16:30:59,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59913 states. [2019-12-07 16:30:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59913 states to 59913 states and 203044 transitions. [2019-12-07 16:30:59,589 INFO L78 Accepts]: Start accepts. Automaton has 59913 states and 203044 transitions. Word has length 35 [2019-12-07 16:30:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:59,589 INFO L462 AbstractCegarLoop]: Abstraction has 59913 states and 203044 transitions. [2019-12-07 16:30:59,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:30:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 59913 states and 203044 transitions. [2019-12-07 16:30:59,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 16:30:59,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:59,630 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:59,630 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:59,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:59,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1025634159, now seen corresponding path program 2 times [2019-12-07 16:30:59,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:30:59,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473258220] [2019-12-07 16:30:59,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:59,677 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 16:30:59,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473258220] [2019-12-07 16:30:59,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:30:59,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:30:59,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786134498] [2019-12-07 16:30:59,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:30:59,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:30:59,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:30:59,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:30:59,678 INFO L87 Difference]: Start difference. First operand 59913 states and 203044 transitions. Second operand 4 states. [2019-12-07 16:31:00,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:00,053 INFO L93 Difference]: Finished difference Result 85008 states and 286715 transitions. [2019-12-07 16:31:00,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:31:00,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 16:31:00,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:00,193 INFO L225 Difference]: With dead ends: 85008 [2019-12-07 16:31:00,193 INFO L226 Difference]: Without dead ends: 85008 [2019-12-07 16:31:00,193 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 16:31:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85008 states. [2019-12-07 16:31:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85008 to 58542. [2019-12-07 16:31:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58542 states. [2019-12-07 16:31:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58542 states to 58542 states and 196581 transitions. [2019-12-07 16:31:01,547 INFO L78 Accepts]: Start accepts. Automaton has 58542 states and 196581 transitions. Word has length 35 [2019-12-07 16:31:01,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:01,547 INFO L462 AbstractCegarLoop]: Abstraction has 58542 states and 196581 transitions. [2019-12-07 16:31:01,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:31:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 58542 states and 196581 transitions. [2019-12-07 16:31:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 16:31:01,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:01,590 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:01,590 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:31:01,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:01,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1396410162, now seen corresponding path program 1 times [2019-12-07 16:31:01,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:01,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185916553] [2019-12-07 16:31:01,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:01,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185916553] [2019-12-07 16:31:01,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:01,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:31:01,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623827827] [2019-12-07 16:31:01,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:31:01,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:01,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:31:01,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:31:01,633 INFO L87 Difference]: Start difference. First operand 58542 states and 196581 transitions. Second operand 5 states. [2019-12-07 16:31:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:01,687 INFO L93 Difference]: Finished difference Result 9573 states and 27667 transitions. [2019-12-07 16:31:01,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:31:01,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-07 16:31:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:01,695 INFO L225 Difference]: With dead ends: 9573 [2019-12-07 16:31:01,695 INFO L226 Difference]: Without dead ends: 6812 [2019-12-07 16:31:01,695 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 16:31:01,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6812 states. [2019-12-07 16:31:01,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6812 to 6730. [2019-12-07 16:31:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6730 states. [2019-12-07 16:31:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6730 states to 6730 states and 18216 transitions. [2019-12-07 16:31:01,768 INFO L78 Accepts]: Start accepts. Automaton has 6730 states and 18216 transitions. Word has length 36 [2019-12-07 16:31:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:01,768 INFO L462 AbstractCegarLoop]: Abstraction has 6730 states and 18216 transitions. [2019-12-07 16:31:01,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:31:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6730 states and 18216 transitions. [2019-12-07 16:31:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 16:31:01,773 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:01,773 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] [2019-12-07 16:31:01,773 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:31:01,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:01,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1883380707, now seen corresponding path program 1 times [2019-12-07 16:31:01,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:01,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649014071] [2019-12-07 16:31:01,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:01,917 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 16:31:01,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649014071] [2019-12-07 16:31:01,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:01,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:31:01,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954116815] [2019-12-07 16:31:01,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:31:01,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:01,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:31:01,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:31:01,919 INFO L87 Difference]: Start difference. First operand 6730 states and 18216 transitions. Second operand 9 states. [2019-12-07 16:31:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:02,458 INFO L93 Difference]: Finished difference Result 10967 states and 28520 transitions. [2019-12-07 16:31:02,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 16:31:02,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-12-07 16:31:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:02,467 INFO L225 Difference]: With dead ends: 10967 [2019-12-07 16:31:02,467 INFO L226 Difference]: Without dead ends: 10720 [2019-12-07 16:31:02,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:31:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10720 states. [2019-12-07 16:31:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10720 to 6494. [2019-12-07 16:31:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6494 states. [2019-12-07 16:31:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6494 states to 6494 states and 17663 transitions. [2019-12-07 16:31:02,600 INFO L78 Accepts]: Start accepts. Automaton has 6494 states and 17663 transitions. Word has length 47 [2019-12-07 16:31:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:02,600 INFO L462 AbstractCegarLoop]: Abstraction has 6494 states and 17663 transitions. [2019-12-07 16:31:02,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:31:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 6494 states and 17663 transitions. [2019-12-07 16:31:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 16:31:02,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:02,604 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] [2019-12-07 16:31:02,604 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:31:02,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:02,605 INFO L82 PathProgramCache]: Analyzing trace with hash -252125873, now seen corresponding path program 2 times [2019-12-07 16:31:02,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:02,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192016816] [2019-12-07 16:31:02,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:02,665 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 16:31:02,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192016816] [2019-12-07 16:31:02,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:02,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:31:02,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233157488] [2019-12-07 16:31:02,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:31:02,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:02,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:31:02,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:31:02,666 INFO L87 Difference]: Start difference. First operand 6494 states and 17663 transitions. Second operand 6 states. [2019-12-07 16:31:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:02,712 INFO L93 Difference]: Finished difference Result 4880 states and 13990 transitions. [2019-12-07 16:31:02,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:31:02,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-07 16:31:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:02,716 INFO L225 Difference]: With dead ends: 4880 [2019-12-07 16:31:02,716 INFO L226 Difference]: Without dead ends: 4219 [2019-12-07 16:31:02,717 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 16:31:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4219 states. [2019-12-07 16:31:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4219 to 3870. [2019-12-07 16:31:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3870 states. [2019-12-07 16:31:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 11458 transitions. [2019-12-07 16:31:02,761 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 11458 transitions. Word has length 47 [2019-12-07 16:31:02,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:02,762 INFO L462 AbstractCegarLoop]: Abstraction has 3870 states and 11458 transitions. [2019-12-07 16:31:02,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:31:02,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 11458 transitions. [2019-12-07 16:31:02,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 16:31:02,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:02,765 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] [2019-12-07 16:31:02,765 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:31:02,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:02,765 INFO L82 PathProgramCache]: Analyzing trace with hash -55127569, now seen corresponding path program 1 times [2019-12-07 16:31:02,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:02,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771397437] [2019-12-07 16:31:02,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:02,817 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 16:31:02,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771397437] [2019-12-07 16:31:02,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:02,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:31:02,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061648493] [2019-12-07 16:31:02,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:31:02,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:02,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:31:02,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:31:02,819 INFO L87 Difference]: Start difference. First operand 3870 states and 11458 transitions. Second operand 5 states. [2019-12-07 16:31:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:02,982 INFO L93 Difference]: Finished difference Result 4372 states and 12811 transitions. [2019-12-07 16:31:02,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:31:02,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-12-07 16:31:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:02,986 INFO L225 Difference]: With dead ends: 4372 [2019-12-07 16:31:02,987 INFO L226 Difference]: Without dead ends: 4372 [2019-12-07 16:31:02,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:31:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4372 states. [2019-12-07 16:31:03,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4372 to 3892. [2019-12-07 16:31:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3892 states. [2019-12-07 16:31:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 11517 transitions. [2019-12-07 16:31:03,031 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 11517 transitions. Word has length 62 [2019-12-07 16:31:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:03,031 INFO L462 AbstractCegarLoop]: Abstraction has 3892 states and 11517 transitions. [2019-12-07 16:31:03,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:31:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 11517 transitions. [2019-12-07 16:31:03,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 16:31:03,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:03,034 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] [2019-12-07 16:31:03,034 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:31:03,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:03,034 INFO L82 PathProgramCache]: Analyzing trace with hash -26796177, now seen corresponding path program 2 times [2019-12-07 16:31:03,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:03,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440833087] [2019-12-07 16:31:03,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:03,094 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 16:31:03,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440833087] [2019-12-07 16:31:03,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:03,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:31:03,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251349818] [2019-12-07 16:31:03,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:31:03,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:03,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:31:03,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:31:03,095 INFO L87 Difference]: Start difference. First operand 3892 states and 11517 transitions. Second operand 5 states. [2019-12-07 16:31:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:03,142 INFO L93 Difference]: Finished difference Result 6146 states and 17043 transitions. [2019-12-07 16:31:03,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:31:03,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-12-07 16:31:03,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:03,147 INFO L225 Difference]: With dead ends: 6146 [2019-12-07 16:31:03,147 INFO L226 Difference]: Without dead ends: 2702 [2019-12-07 16:31:03,147 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 16:31:03,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-12-07 16:31:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2383. [2019-12-07 16:31:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2383 states. [2019-12-07 16:31:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 6203 transitions. [2019-12-07 16:31:03,180 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 6203 transitions. Word has length 62 [2019-12-07 16:31:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:03,180 INFO L462 AbstractCegarLoop]: Abstraction has 2383 states and 6203 transitions. [2019-12-07 16:31:03,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:31:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 6203 transitions. [2019-12-07 16:31:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 16:31:03,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:03,182 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] [2019-12-07 16:31:03,182 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:31:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1272485637, now seen corresponding path program 3 times [2019-12-07 16:31:03,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:03,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949726665] [2019-12-07 16:31:03,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:03,224 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 16:31:03,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949726665] [2019-12-07 16:31:03,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:03,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:31:03,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479324466] [2019-12-07 16:31:03,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:31:03,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:03,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:31:03,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:31:03,225 INFO L87 Difference]: Start difference. First operand 2383 states and 6203 transitions. Second operand 3 states. [2019-12-07 16:31:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:03,238 INFO L93 Difference]: Finished difference Result 2746 states and 7028 transitions. [2019-12-07 16:31:03,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:31:03,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-07 16:31:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:03,239 INFO L225 Difference]: With dead ends: 2746 [2019-12-07 16:31:03,239 INFO L226 Difference]: Without dead ends: 423 [2019-12-07 16:31:03,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:31:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-12-07 16:31:03,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2019-12-07 16:31:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-12-07 16:31:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 914 transitions. [2019-12-07 16:31:03,243 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 914 transitions. Word has length 62 [2019-12-07 16:31:03,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:03,243 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 914 transitions. [2019-12-07 16:31:03,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:31:03,243 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 914 transitions. [2019-12-07 16:31:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 16:31:03,244 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:03,244 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] [2019-12-07 16:31:03,244 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:31:03,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:03,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2126696180, now seen corresponding path program 1 times [2019-12-07 16:31:03,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:03,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72059841] [2019-12-07 16:31:03,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:03,301 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 16:31:03,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72059841] [2019-12-07 16:31:03,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:03,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:31:03,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91790292] [2019-12-07 16:31:03,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:31:03,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:03,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:31:03,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:31:03,302 INFO L87 Difference]: Start difference. First operand 423 states and 914 transitions. Second operand 8 states. [2019-12-07 16:31:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:03,437 INFO L93 Difference]: Finished difference Result 1174 states and 2531 transitions. [2019-12-07 16:31:03,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:31:03,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 16:31:03,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:03,438 INFO L225 Difference]: With dead ends: 1174 [2019-12-07 16:31:03,438 INFO L226 Difference]: Without dead ends: 939 [2019-12-07 16:31:03,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:31:03,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-12-07 16:31:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 506. [2019-12-07 16:31:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-12-07 16:31:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1093 transitions. [2019-12-07 16:31:03,445 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1093 transitions. Word has length 63 [2019-12-07 16:31:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:03,445 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 1093 transitions. [2019-12-07 16:31:03,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:31:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1093 transitions. [2019-12-07 16:31:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 16:31:03,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:03,446 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] [2019-12-07 16:31:03,446 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:31:03,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:03,446 INFO L82 PathProgramCache]: Analyzing trace with hash 222753420, now seen corresponding path program 2 times [2019-12-07 16:31:03,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:03,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537484513] [2019-12-07 16:31:03,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:31:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:31:03,541 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 16:31:03,541 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:31:03,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~z$flush_delayed~0_312) (= v_~z$r_buff0_thd1~0_133 0) (= |v_#NULL.offset_6| 0) (= 0 |v_ULTIMATE.start_main_~#t302~0.offset_23|) (= 0 v_~z$r_buff1_thd3~0_369) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~x~0_59 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t302~0.base_31| 4)) (= v_~z$read_delayed~0_6 0) (= v_~main$tmp_guard1~0_30 0) (= v_~z$w_buff0~0_407 0) (= v_~z$r_buff1_thd0~0_262 0) (= v_~z$r_buff1_thd1~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_53) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$mem_tmp~0_246) (= v_~z$r_buff1_thd2~0_361 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t302~0.base_31|) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$w_buff0_used~0_953 0) (= v_~z$r_buff0_thd0~0_190 0) (= v_~a~0_20 0) (= v_~weak$$choice2~0_312 0) (= 0 |v_#NULL.base_6|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t302~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t302~0.base_31|) |v_ULTIMATE.start_main_~#t302~0.offset_23| 0)) |v_#memory_int_23|) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~z$r_buff0_thd3~0_586) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$w_buff1~0_282 0) (= v_~z$w_buff1_used~0_540 0) (= v_~z$r_buff0_thd2~0_401 0) (= 0 v_~weak$$choice0~0_233) (= v_~main$tmp_guard0~0_32 0) (= v_~__unbuffered_cnt~0_150 0) (= v_~y~0_37 0) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t302~0.base_31| 1)) (= v_~z~0_322 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t302~0.base_31|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_361, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_190, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ULTIMATE.start_main_~#t304~0.base=|v_ULTIMATE.start_main_~#t304~0.base_22|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_246, ULTIMATE.start_main_~#t303~0.base=|v_ULTIMATE.start_main_~#t303~0.base_22|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_58|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_540, ~z$flush_delayed~0=v_~z$flush_delayed~0_312, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~weak$$choice0~0=v_~weak$$choice0~0_233, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_201, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_586, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_150, ~x~0=v_~x~0_59, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t302~0.offset=|v_ULTIMATE.start_main_~#t302~0.offset_23|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_282, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t302~0.base=|v_ULTIMATE.start_main_~#t302~0.base_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_262, ~y~0=v_~y~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_401, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_953, ~z$w_buff0~0=v_~z$w_buff0~0_407, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_369, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_73|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ULTIMATE.start_main_~#t304~0.offset=|v_ULTIMATE.start_main_~#t304~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_446|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t303~0.offset=|v_ULTIMATE.start_main_~#t303~0.offset_18|, ~z~0=v_~z~0_322, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_133} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t304~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t303~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~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, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t302~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t302~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t304~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t303~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:31:03,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L838-1-->L840: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t303~0.base_10|)) (= |v_ULTIMATE.start_main_~#t303~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t303~0.base_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t303~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t303~0.base_10|) |v_ULTIMATE.start_main_~#t303~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t303~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t303~0.base_10| 4)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t303~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t303~0.base=|v_ULTIMATE.start_main_~#t303~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t303~0.offset=|v_ULTIMATE.start_main_~#t303~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t303~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t303~0.offset, #length] because there is no mapped edge [2019-12-07 16:31:03,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L840-1-->L842: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t304~0.base_11| 4) |v_#length_17|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t304~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t304~0.base_11|) |v_ULTIMATE.start_main_~#t304~0.offset_10| 2))) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t304~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t304~0.offset_10|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t304~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t304~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t304~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t304~0.base=|v_ULTIMATE.start_main_~#t304~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t304~0.offset=|v_ULTIMATE.start_main_~#t304~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t304~0.base, #length, ULTIMATE.start_main_~#t304~0.offset] because there is no mapped edge [2019-12-07 16:31:03,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] P2ENTRY-->L4-3: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.base_19| v_P2Thread1of1ForFork0_~arg.base_17) (= v_~z$w_buff0~0_55 v_~z$w_buff1~0_45) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_19| v_P2Thread1of1ForFork0_~arg.offset_17) (= v_~z$w_buff0_used~0_158 v_~z$w_buff1_used~0_82) (= 1 v_~z$w_buff0~0_54) (= v_~z$w_buff0_used~0_157 1) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|) (= (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_157 256))) (not (= (mod v_~z$w_buff1_used~0_82 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_158, ~z$w_buff0~0=v_~z$w_buff0~0_55, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_157, ~z$w_buff0~0=v_~z$w_buff0~0_54, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$w_buff1~0=v_~z$w_buff1~0_45, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 16:31:03,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L800-2-->L800-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out508960762| |P2Thread1of1ForFork0_#t~ite28_Out508960762|)) (.cse2 (= (mod ~z$w_buff0_used~0_In508960762 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In508960762 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= ~z$w_buff0~0_In508960762 |P2Thread1of1ForFork0_#t~ite28_Out508960762|)) (and .cse1 (or .cse2 .cse0) (= ~z$w_buff1~0_In508960762 |P2Thread1of1ForFork0_#t~ite28_Out508960762|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In508960762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In508960762, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In508960762, ~z$w_buff1~0=~z$w_buff1~0_In508960762} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out508960762|, ~z$w_buff0~0=~z$w_buff0~0_In508960762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In508960762, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In508960762, ~z$w_buff1~0=~z$w_buff1~0_In508960762, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out508960762|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 16:31:03,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L805-->L806: Formula: (and (= v_~z$r_buff0_thd3~0_95 v_~z$r_buff0_thd3~0_94) (not (= (mod v_~weak$$choice2~0_47 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_47} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_94, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_6|, ~weak$$choice2~0=v_~weak$$choice2~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 16:31:03,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-106940675 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-106940675| ~z$mem_tmp~0_In-106940675) (not .cse0)) (and .cse0 (= ~z~0_In-106940675 |P2Thread1of1ForFork0_#t~ite48_Out-106940675|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-106940675, ~z$flush_delayed~0=~z$flush_delayed~0_In-106940675, ~z~0=~z~0_In-106940675} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-106940675|, ~z$mem_tmp~0=~z$mem_tmp~0_In-106940675, ~z$flush_delayed~0=~z$flush_delayed~0_In-106940675, ~z~0=~z~0_In-106940675} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 16:31:03,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_36 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{~a~0=v_~a~0_13, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 16:31:03,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In45465674 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In45465674 256)))) (or (and (= ~z$w_buff0_used~0_In45465674 |P2Thread1of1ForFork0_#t~ite51_Out45465674|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out45465674| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In45465674, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In45465674} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In45465674, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In45465674, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out45465674|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 16:31:03,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L817-->L817-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In879826293 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In879826293 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In879826293 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In879826293 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out879826293|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In879826293 |P2Thread1of1ForFork0_#t~ite52_Out879826293|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In879826293, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In879826293, ~z$w_buff1_used~0=~z$w_buff1_used~0_In879826293, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In879826293} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In879826293, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In879826293, ~z$w_buff1_used~0=~z$w_buff1_used~0_In879826293, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out879826293|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In879826293} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 16:31:03,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L818-->L819: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-341047713 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-341047713 256) 0)) (.cse1 (= ~z$r_buff0_thd3~0_Out-341047713 ~z$r_buff0_thd3~0_In-341047713))) (or (and .cse0 .cse1) (and (= ~z$r_buff0_thd3~0_Out-341047713 0) (not .cse2) (not .cse0)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-341047713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-341047713} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-341047713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-341047713, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-341047713|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 16:31:03,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In422672801 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In422672801 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In422672801 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In422672801 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In422672801 |P2Thread1of1ForFork0_#t~ite54_Out422672801|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out422672801| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In422672801, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In422672801, ~z$w_buff1_used~0=~z$w_buff1_used~0_In422672801, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In422672801} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In422672801, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out422672801|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In422672801, ~z$w_buff1_used~0=~z$w_buff1_used~0_In422672801, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In422672801} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 16:31:03,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L819-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_301 |v_P2Thread1of1ForFork0_#t~ite54_30|) (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 16:31:03,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In608099187 256)))) (or (and .cse0 (= ~z~0_In608099187 |P1Thread1of1ForFork2_#t~ite25_Out608099187|)) (and (not .cse0) (= ~z$mem_tmp~0_In608099187 |P1Thread1of1ForFork2_#t~ite25_Out608099187|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In608099187, ~z$flush_delayed~0=~z$flush_delayed~0_In608099187, ~z~0=~z~0_In608099187} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In608099187, ~z$flush_delayed~0=~z$flush_delayed~0_In608099187, ~z~0=~z~0_In608099187, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out608099187|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 16:31:03,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= 0 v_~z$flush_delayed~0_126) (= v_~z~0_145 |v_P1Thread1of1ForFork2_#t~ite25_56|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_56|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_126, ~z~0=v_~z~0_145, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_55|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 16:31:03,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L846-->L848-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_18 256)) (= 0 (mod v_~z$w_buff0_used~0_136 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 16:31:03,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L848-2-->L848-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite58_Out-771297486| |ULTIMATE.start_main_#t~ite59_Out-771297486|)) (.cse0 (= (mod ~z$w_buff1_used~0_In-771297486 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-771297486 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite58_Out-771297486| ~z$w_buff1~0_In-771297486) (not .cse1) .cse2) (and .cse2 (= |ULTIMATE.start_main_#t~ite58_Out-771297486| ~z~0_In-771297486) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-771297486, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-771297486, ~z$w_buff1~0=~z$w_buff1~0_In-771297486, ~z~0=~z~0_In-771297486} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-771297486, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-771297486|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-771297486, ~z$w_buff1~0=~z$w_buff1~0_In-771297486, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-771297486|, ~z~0=~z~0_In-771297486} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 16:31:03,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1205428240 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1205428240 256)))) (or (and (= ~z$w_buff0_used~0_In-1205428240 |ULTIMATE.start_main_#t~ite60_Out-1205428240|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out-1205428240| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1205428240, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1205428240} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1205428240|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1205428240, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1205428240} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 16:31:03,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L850-->L850-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-387899777 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-387899777 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-387899777 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-387899777 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-387899777 |ULTIMATE.start_main_#t~ite61_Out-387899777|)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-387899777|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-387899777, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-387899777, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-387899777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-387899777} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-387899777, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-387899777|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-387899777, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-387899777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-387899777} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 16:31:03,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In586951212 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In586951212 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In586951212 |ULTIMATE.start_main_#t~ite62_Out586951212|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out586951212| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In586951212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In586951212} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out586951212|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In586951212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In586951212} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 16:31:03,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L852-->L852-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-454883617 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-454883617 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-454883617 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-454883617 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite63_Out-454883617| ~z$r_buff1_thd0~0_In-454883617)) (and (= |ULTIMATE.start_main_#t~ite63_Out-454883617| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-454883617, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-454883617, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-454883617, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-454883617} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-454883617|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-454883617, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-454883617, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-454883617, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-454883617} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 16:31:03,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L852-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_249 |v_ULTIMATE.start_main_#t~ite63_36|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~x~0_50 2) (= v_~__unbuffered_p1_EBX~0_20 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= 1 v_~__unbuffered_p1_EAX~0_44))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_35|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:31:03,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:31:03 BasicIcfg [2019-12-07 16:31:03,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:31:03,621 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:31:03,621 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:31:03,621 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:31:03,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:30:40" (3/4) ... [2019-12-07 16:31:03,623 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:31:03,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~z$flush_delayed~0_312) (= v_~z$r_buff0_thd1~0_133 0) (= |v_#NULL.offset_6| 0) (= 0 |v_ULTIMATE.start_main_~#t302~0.offset_23|) (= 0 v_~z$r_buff1_thd3~0_369) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~x~0_59 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t302~0.base_31| 4)) (= v_~z$read_delayed~0_6 0) (= v_~main$tmp_guard1~0_30 0) (= v_~z$w_buff0~0_407 0) (= v_~z$r_buff1_thd0~0_262 0) (= v_~z$r_buff1_thd1~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_53) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$mem_tmp~0_246) (= v_~z$r_buff1_thd2~0_361 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t302~0.base_31|) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$w_buff0_used~0_953 0) (= v_~z$r_buff0_thd0~0_190 0) (= v_~a~0_20 0) (= v_~weak$$choice2~0_312 0) (= 0 |v_#NULL.base_6|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t302~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t302~0.base_31|) |v_ULTIMATE.start_main_~#t302~0.offset_23| 0)) |v_#memory_int_23|) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~z$r_buff0_thd3~0_586) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$w_buff1~0_282 0) (= v_~z$w_buff1_used~0_540 0) (= v_~z$r_buff0_thd2~0_401 0) (= 0 v_~weak$$choice0~0_233) (= v_~main$tmp_guard0~0_32 0) (= v_~__unbuffered_cnt~0_150 0) (= v_~y~0_37 0) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t302~0.base_31| 1)) (= v_~z~0_322 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t302~0.base_31|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_361, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_190, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ULTIMATE.start_main_~#t304~0.base=|v_ULTIMATE.start_main_~#t304~0.base_22|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_246, ULTIMATE.start_main_~#t303~0.base=|v_ULTIMATE.start_main_~#t303~0.base_22|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_58|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_540, ~z$flush_delayed~0=v_~z$flush_delayed~0_312, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~weak$$choice0~0=v_~weak$$choice0~0_233, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_201, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_586, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_150, ~x~0=v_~x~0_59, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t302~0.offset=|v_ULTIMATE.start_main_~#t302~0.offset_23|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_282, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t302~0.base=|v_ULTIMATE.start_main_~#t302~0.base_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_262, ~y~0=v_~y~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_401, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_953, ~z$w_buff0~0=v_~z$w_buff0~0_407, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_369, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_73|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ULTIMATE.start_main_~#t304~0.offset=|v_ULTIMATE.start_main_~#t304~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_446|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t303~0.offset=|v_ULTIMATE.start_main_~#t303~0.offset_18|, ~z~0=v_~z~0_322, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_133} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t304~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t303~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~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, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t302~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t302~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t304~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t303~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:31:03,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L838-1-->L840: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t303~0.base_10|)) (= |v_ULTIMATE.start_main_~#t303~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t303~0.base_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t303~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t303~0.base_10|) |v_ULTIMATE.start_main_~#t303~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t303~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t303~0.base_10| 4)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t303~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t303~0.base=|v_ULTIMATE.start_main_~#t303~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t303~0.offset=|v_ULTIMATE.start_main_~#t303~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t303~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t303~0.offset, #length] because there is no mapped edge [2019-12-07 16:31:03,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L840-1-->L842: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t304~0.base_11| 4) |v_#length_17|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t304~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t304~0.base_11|) |v_ULTIMATE.start_main_~#t304~0.offset_10| 2))) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t304~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t304~0.offset_10|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t304~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t304~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t304~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t304~0.base=|v_ULTIMATE.start_main_~#t304~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t304~0.offset=|v_ULTIMATE.start_main_~#t304~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t304~0.base, #length, ULTIMATE.start_main_~#t304~0.offset] because there is no mapped edge [2019-12-07 16:31:03,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] P2ENTRY-->L4-3: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.base_19| v_P2Thread1of1ForFork0_~arg.base_17) (= v_~z$w_buff0~0_55 v_~z$w_buff1~0_45) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_19| v_P2Thread1of1ForFork0_~arg.offset_17) (= v_~z$w_buff0_used~0_158 v_~z$w_buff1_used~0_82) (= 1 v_~z$w_buff0~0_54) (= v_~z$w_buff0_used~0_157 1) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|) (= (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_157 256))) (not (= (mod v_~z$w_buff1_used~0_82 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_158, ~z$w_buff0~0=v_~z$w_buff0~0_55, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_157, ~z$w_buff0~0=v_~z$w_buff0~0_54, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$w_buff1~0=v_~z$w_buff1~0_45, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 16:31:03,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L800-2-->L800-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out508960762| |P2Thread1of1ForFork0_#t~ite28_Out508960762|)) (.cse2 (= (mod ~z$w_buff0_used~0_In508960762 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In508960762 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= ~z$w_buff0~0_In508960762 |P2Thread1of1ForFork0_#t~ite28_Out508960762|)) (and .cse1 (or .cse2 .cse0) (= ~z$w_buff1~0_In508960762 |P2Thread1of1ForFork0_#t~ite28_Out508960762|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In508960762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In508960762, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In508960762, ~z$w_buff1~0=~z$w_buff1~0_In508960762} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out508960762|, ~z$w_buff0~0=~z$w_buff0~0_In508960762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In508960762, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In508960762, ~z$w_buff1~0=~z$w_buff1~0_In508960762, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out508960762|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 16:31:03,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L805-->L806: Formula: (and (= v_~z$r_buff0_thd3~0_95 v_~z$r_buff0_thd3~0_94) (not (= (mod v_~weak$$choice2~0_47 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_47} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_94, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_6|, ~weak$$choice2~0=v_~weak$$choice2~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 16:31:03,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-106940675 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-106940675| ~z$mem_tmp~0_In-106940675) (not .cse0)) (and .cse0 (= ~z~0_In-106940675 |P2Thread1of1ForFork0_#t~ite48_Out-106940675|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-106940675, ~z$flush_delayed~0=~z$flush_delayed~0_In-106940675, ~z~0=~z~0_In-106940675} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-106940675|, ~z$mem_tmp~0=~z$mem_tmp~0_In-106940675, ~z$flush_delayed~0=~z$flush_delayed~0_In-106940675, ~z~0=~z~0_In-106940675} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 16:31:03,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_36 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{~a~0=v_~a~0_13, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 16:31:03,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In45465674 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In45465674 256)))) (or (and (= ~z$w_buff0_used~0_In45465674 |P2Thread1of1ForFork0_#t~ite51_Out45465674|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out45465674| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In45465674, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In45465674} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In45465674, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In45465674, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out45465674|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 16:31:03,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L817-->L817-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In879826293 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In879826293 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In879826293 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In879826293 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out879826293|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In879826293 |P2Thread1of1ForFork0_#t~ite52_Out879826293|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In879826293, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In879826293, ~z$w_buff1_used~0=~z$w_buff1_used~0_In879826293, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In879826293} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In879826293, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In879826293, ~z$w_buff1_used~0=~z$w_buff1_used~0_In879826293, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out879826293|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In879826293} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 16:31:03,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L818-->L819: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-341047713 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-341047713 256) 0)) (.cse1 (= ~z$r_buff0_thd3~0_Out-341047713 ~z$r_buff0_thd3~0_In-341047713))) (or (and .cse0 .cse1) (and (= ~z$r_buff0_thd3~0_Out-341047713 0) (not .cse2) (not .cse0)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-341047713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-341047713} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-341047713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-341047713, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-341047713|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 16:31:03,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In422672801 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In422672801 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In422672801 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In422672801 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In422672801 |P2Thread1of1ForFork0_#t~ite54_Out422672801|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out422672801| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In422672801, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In422672801, ~z$w_buff1_used~0=~z$w_buff1_used~0_In422672801, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In422672801} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In422672801, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out422672801|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In422672801, ~z$w_buff1_used~0=~z$w_buff1_used~0_In422672801, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In422672801} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 16:31:03,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L819-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_301 |v_P2Thread1of1ForFork0_#t~ite54_30|) (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 16:31:03,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In608099187 256)))) (or (and .cse0 (= ~z~0_In608099187 |P1Thread1of1ForFork2_#t~ite25_Out608099187|)) (and (not .cse0) (= ~z$mem_tmp~0_In608099187 |P1Thread1of1ForFork2_#t~ite25_Out608099187|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In608099187, ~z$flush_delayed~0=~z$flush_delayed~0_In608099187, ~z~0=~z~0_In608099187} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In608099187, ~z$flush_delayed~0=~z$flush_delayed~0_In608099187, ~z~0=~z~0_In608099187, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out608099187|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 16:31:03,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= 0 v_~z$flush_delayed~0_126) (= v_~z~0_145 |v_P1Thread1of1ForFork2_#t~ite25_56|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_56|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_126, ~z~0=v_~z~0_145, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_55|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 16:31:03,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L846-->L848-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_18 256)) (= 0 (mod v_~z$w_buff0_used~0_136 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 16:31:03,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L848-2-->L848-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite58_Out-771297486| |ULTIMATE.start_main_#t~ite59_Out-771297486|)) (.cse0 (= (mod ~z$w_buff1_used~0_In-771297486 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-771297486 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite58_Out-771297486| ~z$w_buff1~0_In-771297486) (not .cse1) .cse2) (and .cse2 (= |ULTIMATE.start_main_#t~ite58_Out-771297486| ~z~0_In-771297486) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-771297486, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-771297486, ~z$w_buff1~0=~z$w_buff1~0_In-771297486, ~z~0=~z~0_In-771297486} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-771297486, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-771297486|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-771297486, ~z$w_buff1~0=~z$w_buff1~0_In-771297486, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-771297486|, ~z~0=~z~0_In-771297486} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 16:31:03,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1205428240 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1205428240 256)))) (or (and (= ~z$w_buff0_used~0_In-1205428240 |ULTIMATE.start_main_#t~ite60_Out-1205428240|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out-1205428240| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1205428240, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1205428240} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1205428240|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1205428240, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1205428240} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 16:31:03,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L850-->L850-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-387899777 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-387899777 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-387899777 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-387899777 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-387899777 |ULTIMATE.start_main_#t~ite61_Out-387899777|)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-387899777|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-387899777, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-387899777, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-387899777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-387899777} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-387899777, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-387899777|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-387899777, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-387899777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-387899777} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 16:31:03,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In586951212 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In586951212 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In586951212 |ULTIMATE.start_main_#t~ite62_Out586951212|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out586951212| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In586951212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In586951212} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out586951212|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In586951212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In586951212} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 16:31:03,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L852-->L852-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-454883617 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-454883617 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-454883617 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-454883617 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite63_Out-454883617| ~z$r_buff1_thd0~0_In-454883617)) (and (= |ULTIMATE.start_main_#t~ite63_Out-454883617| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-454883617, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-454883617, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-454883617, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-454883617} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-454883617|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-454883617, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-454883617, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-454883617, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-454883617} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 16:31:03,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L852-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_249 |v_ULTIMATE.start_main_#t~ite63_36|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~x~0_50 2) (= v_~__unbuffered_p1_EBX~0_20 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= 1 v_~__unbuffered_p1_EAX~0_44))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_35|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:31:03,714 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9a6446fc-a21f-4be0-99e4-861c0e2e8575/bin/utaipan/witness.graphml [2019-12-07 16:31:03,715 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:31:03,716 INFO L168 Benchmark]: Toolchain (without parser) took 24196.77 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 934.0 MB in the beginning and 1.8 GB in the end (delta: -840.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 16:31:03,716 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:31:03,716 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:31:03,717 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.11 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:31:03,717 INFO L168 Benchmark]: Boogie Preprocessor took 27.65 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:31:03,717 INFO L168 Benchmark]: RCFGBuilder took 450.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.9 MB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:31:03,718 INFO L168 Benchmark]: TraceAbstraction took 23163.27 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 996.9 MB in the beginning and 1.8 GB in the end (delta: -822.0 MB). Peak memory consumption was 926.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:31:03,718 INFO L168 Benchmark]: Witness Printer took 93.57 ms. Allocated memory is still 2.9 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:31:03,719 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 415.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.11 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.65 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 450.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.9 MB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23163.27 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 996.9 MB in the beginning and 1.8 GB in the end (delta: -822.0 MB). Peak memory consumption was 926.0 MB. Max. memory is 11.5 GB. * Witness Printer took 93.57 ms. Allocated memory is still 2.9 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 196 ProgramPointsBefore, 103 ProgramPointsAfterwards, 242 TransitionsBefore, 122 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 31 ChoiceCompositions, 9041 VarBasedMoverChecksPositive, 312 VarBasedMoverChecksNegative, 82 SemBasedMoverChecksPositive, 320 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 115591 CheckedPairsTotal, 128 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L838] FCALL, FORK 0 pthread_create(&t302, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] FCALL, FORK 0 pthread_create(&t303, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t304, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = (_Bool)1 [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 z$flush_delayed = weak$$choice2 [L799] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 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) [L801] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 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)) [L802] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 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)) [L803] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 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)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 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)) [L806] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 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)) [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z = z$flush_delayed ? z$mem_tmp : z [L809] 3 z$flush_delayed = (_Bool)0 [L812] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 y = 1 [L756] 2 __unbuffered_p1_EAX = y [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 z$flush_delayed = weak$$choice2 [L762] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L764] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L765] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L766] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L769] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 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) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 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 [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3415 SDtfs, 4545 SDslu, 6482 SDs, 0 SdLazy, 2275 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59913occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 74217 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 671 NumberOfCodeBlocks, 671 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 591 ConstructedInterpolants, 0 QuantifiedInterpolants, 122787 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...