./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_pso.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_6ca1f363-8431-4dd1-a805-943fba8dd12d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6ca1f363-8431-4dd1-a805-943fba8dd12d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6ca1f363-8431-4dd1-a805-943fba8dd12d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6ca1f363-8431-4dd1-a805-943fba8dd12d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6ca1f363-8431-4dd1-a805-943fba8dd12d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6ca1f363-8431-4dd1-a805-943fba8dd12d/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 ebde15fdb52026375d3a16b6ef78579eac71259b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:30:50,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:30:50,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:30:50,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:30:50,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:30:51,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:30:51,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:30:51,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:30:51,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:30:51,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:30:51,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:30:51,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:30:51,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:30:51,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:30:51,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:30:51,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:30:51,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:30:51,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:30:51,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:30:51,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:30:51,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:30:51,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:30:51,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:30:51,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:30:51,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:30:51,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:30:51,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:30:51,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:30:51,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:30:51,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:30:51,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:30:51,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:30:51,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:30:51,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:30:51,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:30:51,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:30:51,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:30:51,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:30:51,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:30:51,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:30:51,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:30:51,029 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6ca1f363-8431-4dd1-a805-943fba8dd12d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 10:30:51,041 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:30:51,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:30:51,042 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:30:51,042 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:30:51,042 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:30:51,042 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:30:51,042 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 10:30:51,042 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:30:51,042 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:30:51,042 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 10:30:51,043 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 10:30:51,043 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:30:51,043 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 10:30:51,043 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 10:30:51,043 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 10:30:51,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:30:51,044 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:30:51,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:30:51,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:30:51,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:30:51,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:30:51,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:30:51,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:30:51,045 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:30:51,045 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:30:51,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:30:51,045 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:30:51,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:30:51,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:30:51,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:30:51,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:30:51,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:30:51,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:30:51,046 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:30:51,046 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:30:51,046 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 10:30:51,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:30:51,047 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:30:51,047 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:30:51,047 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:30:51,047 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_6ca1f363-8431-4dd1-a805-943fba8dd12d/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 -> ebde15fdb52026375d3a16b6ef78579eac71259b [2019-12-07 10:30:51,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:30:51,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:30:51,163 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:30:51,165 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:30:51,165 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:30:51,166 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6ca1f363-8431-4dd1-a805-943fba8dd12d/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix027_pso.opt.i [2019-12-07 10:30:51,208 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6ca1f363-8431-4dd1-a805-943fba8dd12d/bin/utaipan/data/095856114/be98f7478e49497db2b0c58e9a31ac71/FLAGc1b05ed44 [2019-12-07 10:30:51,670 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:30:51,670 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6ca1f363-8431-4dd1-a805-943fba8dd12d/sv-benchmarks/c/pthread-wmm/mix027_pso.opt.i [2019-12-07 10:30:51,682 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6ca1f363-8431-4dd1-a805-943fba8dd12d/bin/utaipan/data/095856114/be98f7478e49497db2b0c58e9a31ac71/FLAGc1b05ed44 [2019-12-07 10:30:52,185 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6ca1f363-8431-4dd1-a805-943fba8dd12d/bin/utaipan/data/095856114/be98f7478e49497db2b0c58e9a31ac71 [2019-12-07 10:30:52,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:30:52,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:30:52,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:30:52,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:30:52,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:30:52,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:30:52" (1/1) ... [2019-12-07 10:30:52,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9096c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:30:52, skipping insertion in model container [2019-12-07 10:30:52,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:30:52" (1/1) ... [2019-12-07 10:30:52,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:30:52,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:30:52,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:30:52,485 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:30:52,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:30:52,577 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:30:52,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:30:52 WrapperNode [2019-12-07 10:30:52,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:30:52,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:30:52,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:30:52,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:30:52,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:30:52" (1/1) ... [2019-12-07 10:30:52,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:30:52" (1/1) ... [2019-12-07 10:30:52,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:30:52,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:30:52,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:30:52,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:30:52,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:30:52" (1/1) ... [2019-12-07 10:30:52,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:30:52" (1/1) ... [2019-12-07 10:30:52,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:30:52" (1/1) ... [2019-12-07 10:30:52,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:30:52" (1/1) ... [2019-12-07 10:30:52,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:30:52" (1/1) ... [2019-12-07 10:30:52,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:30:52" (1/1) ... [2019-12-07 10:30:52,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:30:52" (1/1) ... [2019-12-07 10:30:52,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:30:52,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:30:52,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:30:52,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:30:52,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:30:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca1f363-8431-4dd1-a805-943fba8dd12d/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:30:52,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:30:52,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:30:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:30:52,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:30:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 10:30:52,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 10:30:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:30:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:30:52,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:30:52,695 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 10:30:53,053 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:30:53,053 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:30:53,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:30:53 BoogieIcfgContainer [2019-12-07 10:30:53,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:30:53,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:30:53,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:30:53,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:30:53,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:30:52" (1/3) ... [2019-12-07 10:30:53,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8418ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:30:53, skipping insertion in model container [2019-12-07 10:30:53,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:30:52" (2/3) ... [2019-12-07 10:30:53,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8418ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:30:53, skipping insertion in model container [2019-12-07 10:30:53,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:30:53" (3/3) ... [2019-12-07 10:30:53,058 INFO L109 eAbstractionObserver]: Analyzing ICFG mix027_pso.opt.i [2019-12-07 10:30:53,065 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:30:53,065 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:30:53,070 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:30:53,070 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:30:53,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,097 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,097 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,108 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,108 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,108 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,108 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,108 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,111 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,111 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,111 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,111 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,112 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,112 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,112 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,112 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,112 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,112 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,112 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,112 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,112 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,113 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,113 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,113 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,113 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,113 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,113 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,113 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,113 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,113 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,113 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,114 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,114 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,114 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,114 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,114 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,114 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,114 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:30:53,126 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 10:30:53,138 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:30:53,139 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:30:53,139 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:30:53,139 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:30:53,139 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:30:53,139 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:30:53,139 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:30:53,139 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:30:53,150 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-07 10:30:53,151 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-07 10:30:53,204 INFO L134 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-07 10:30:53,205 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:30:53,215 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 718 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 10:30:53,230 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-07 10:30:53,262 INFO L134 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-07 10:30:53,262 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:30:53,267 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 718 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 10:30:53,283 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-07 10:30:53,283 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:30:56,411 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 10:30:56,511 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74757 [2019-12-07 10:30:56,511 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-07 10:30:56,513 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-07 10:31:29,309 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 171250 states. [2019-12-07 10:31:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 171250 states. [2019-12-07 10:31:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 10:31:29,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:31:29,315 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:31:29,315 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:31:29,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:31:29,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1969539409, now seen corresponding path program 1 times [2019-12-07 10:31:29,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:31:29,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382956894] [2019-12-07 10:31:29,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:31:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:31:29,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382956894] [2019-12-07 10:31:29,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:31:29,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:31:29,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712097139] [2019-12-07 10:31:29,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:31:29,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:31:29,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:31:29,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:31:29,497 INFO L87 Difference]: Start difference. First operand 171250 states. Second operand 3 states. [2019-12-07 10:31:30,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:31:30,626 INFO L93 Difference]: Finished difference Result 169554 states and 814774 transitions. [2019-12-07 10:31:30,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:31:30,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 10:31:30,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:31:31,425 INFO L225 Difference]: With dead ends: 169554 [2019-12-07 10:31:31,425 INFO L226 Difference]: Without dead ends: 159076 [2019-12-07 10:31:31,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:31:39,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159076 states. [2019-12-07 10:31:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159076 to 159076. [2019-12-07 10:31:41,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159076 states. [2019-12-07 10:31:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159076 states to 159076 states and 763437 transitions. [2019-12-07 10:31:42,353 INFO L78 Accepts]: Start accepts. Automaton has 159076 states and 763437 transitions. Word has length 7 [2019-12-07 10:31:42,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:31:42,354 INFO L462 AbstractCegarLoop]: Abstraction has 159076 states and 763437 transitions. [2019-12-07 10:31:42,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:31:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 159076 states and 763437 transitions. [2019-12-07 10:31:42,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:31:42,362 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:31:42,362 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:31:42,362 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:31:42,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:31:42,362 INFO L82 PathProgramCache]: Analyzing trace with hash 230524214, now seen corresponding path program 1 times [2019-12-07 10:31:42,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:31:42,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343018645] [2019-12-07 10:31:42,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:31:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:31:42,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343018645] [2019-12-07 10:31:42,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:31:42,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:31:42,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151327064] [2019-12-07 10:31:42,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:31:42,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:31:42,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:31:42,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:31:42,429 INFO L87 Difference]: Start difference. First operand 159076 states and 763437 transitions. Second operand 4 states. [2019-12-07 10:31:46,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:31:46,427 INFO L93 Difference]: Finished difference Result 251868 states and 1162713 transitions. [2019-12-07 10:31:46,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:31:46,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 10:31:46,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:31:47,151 INFO L225 Difference]: With dead ends: 251868 [2019-12-07 10:31:47,151 INFO L226 Difference]: Without dead ends: 251658 [2019-12-07 10:31:47,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:31:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251658 states. [2019-12-07 10:31:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251658 to 235278. [2019-12-07 10:31:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235278 states. [2019-12-07 10:31:59,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235278 states to 235278 states and 1094580 transitions. [2019-12-07 10:31:59,252 INFO L78 Accepts]: Start accepts. Automaton has 235278 states and 1094580 transitions. Word has length 15 [2019-12-07 10:31:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:31:59,252 INFO L462 AbstractCegarLoop]: Abstraction has 235278 states and 1094580 transitions. [2019-12-07 10:31:59,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:31:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 235278 states and 1094580 transitions. [2019-12-07 10:31:59,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:31:59,256 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:31:59,256 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:31:59,256 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:31:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:31:59,257 INFO L82 PathProgramCache]: Analyzing trace with hash -519494263, now seen corresponding path program 1 times [2019-12-07 10:31:59,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:31:59,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639020040] [2019-12-07 10:31:59,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:31:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:31:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:31:59,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639020040] [2019-12-07 10:31:59,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:31:59,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:31:59,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479386638] [2019-12-07 10:31:59,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:31:59,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:31:59,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:31:59,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:31:59,311 INFO L87 Difference]: Start difference. First operand 235278 states and 1094580 transitions. Second operand 4 states. [2019-12-07 10:32:01,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:32:01,171 INFO L93 Difference]: Finished difference Result 333248 states and 1520275 transitions. [2019-12-07 10:32:01,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:32:01,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 10:32:01,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:32:02,197 INFO L225 Difference]: With dead ends: 333248 [2019-12-07 10:32:02,197 INFO L226 Difference]: Without dead ends: 333008 [2019-12-07 10:32:02,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:32:14,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333008 states. [2019-12-07 10:32:19,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333008 to 282040. [2019-12-07 10:32:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282040 states. [2019-12-07 10:32:20,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282040 states to 282040 states and 1305129 transitions. [2019-12-07 10:32:20,086 INFO L78 Accepts]: Start accepts. Automaton has 282040 states and 1305129 transitions. Word has length 15 [2019-12-07 10:32:20,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:32:20,087 INFO L462 AbstractCegarLoop]: Abstraction has 282040 states and 1305129 transitions. [2019-12-07 10:32:20,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:32:20,087 INFO L276 IsEmpty]: Start isEmpty. Operand 282040 states and 1305129 transitions. [2019-12-07 10:32:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:32:20,091 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:32:20,091 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:32:20,092 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:32:20,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:32:20,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1627950887, now seen corresponding path program 1 times [2019-12-07 10:32:20,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:32:20,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550937966] [2019-12-07 10:32:20,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:32:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:32:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:32:20,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550937966] [2019-12-07 10:32:20,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:32:20,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:32:20,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020226016] [2019-12-07 10:32:20,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:32:20,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:32:20,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:32:20,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:32:20,144 INFO L87 Difference]: Start difference. First operand 282040 states and 1305129 transitions. Second operand 5 states. [2019-12-07 10:32:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:32:22,814 INFO L93 Difference]: Finished difference Result 380594 states and 1735388 transitions. [2019-12-07 10:32:22,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:32:22,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 10:32:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:32:24,712 INFO L225 Difference]: With dead ends: 380594 [2019-12-07 10:32:24,712 INFO L226 Difference]: Without dead ends: 380290 [2019-12-07 10:32:24,713 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 10:32:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380290 states. [2019-12-07 10:32:42,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380290 to 310408. [2019-12-07 10:32:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310408 states. [2019-12-07 10:32:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310408 states to 310408 states and 1434469 transitions. [2019-12-07 10:32:43,611 INFO L78 Accepts]: Start accepts. Automaton has 310408 states and 1434469 transitions. Word has length 16 [2019-12-07 10:32:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:32:43,612 INFO L462 AbstractCegarLoop]: Abstraction has 310408 states and 1434469 transitions. [2019-12-07 10:32:43,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:32:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 310408 states and 1434469 transitions. [2019-12-07 10:32:43,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:32:43,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:32:43,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:32:43,634 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:32:43,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:32:43,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1371682190, now seen corresponding path program 1 times [2019-12-07 10:32:43,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:32:43,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497054565] [2019-12-07 10:32:43,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:32:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:32:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:32:43,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497054565] [2019-12-07 10:32:43,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:32:43,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:32:43,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125765731] [2019-12-07 10:32:43,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:32:43,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:32:43,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:32:43,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:32:43,695 INFO L87 Difference]: Start difference. First operand 310408 states and 1434469 transitions. Second operand 3 states. [2019-12-07 10:32:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:32:47,776 INFO L93 Difference]: Finished difference Result 587595 states and 2683438 transitions. [2019-12-07 10:32:47,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:32:47,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 10:32:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:32:54,649 INFO L225 Difference]: With dead ends: 587595 [2019-12-07 10:32:54,649 INFO L226 Difference]: Without dead ends: 567599 [2019-12-07 10:32:54,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:33:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567599 states. [2019-12-07 10:33:14,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567599 to 544510. [2019-12-07 10:33:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544510 states. [2019-12-07 10:33:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544510 states to 544510 states and 2498503 transitions. [2019-12-07 10:33:17,996 INFO L78 Accepts]: Start accepts. Automaton has 544510 states and 2498503 transitions. Word has length 20 [2019-12-07 10:33:17,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:33:17,996 INFO L462 AbstractCegarLoop]: Abstraction has 544510 states and 2498503 transitions. [2019-12-07 10:33:17,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:33:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 544510 states and 2498503 transitions. [2019-12-07 10:33:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:33:18,051 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:33:18,051 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:33:18,051 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:33:18,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:33:18,051 INFO L82 PathProgramCache]: Analyzing trace with hash 241904101, now seen corresponding path program 1 times [2019-12-07 10:33:18,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:33:18,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123293902] [2019-12-07 10:33:18,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:33:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:18,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123293902] [2019-12-07 10:33:18,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:33:18,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:33:18,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530302742] [2019-12-07 10:33:18,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:33:18,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:33:18,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:33:18,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:33:18,086 INFO L87 Difference]: Start difference. First operand 544510 states and 2498503 transitions. Second operand 3 states. [2019-12-07 10:33:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:33:26,275 INFO L93 Difference]: Finished difference Result 544166 states and 2496987 transitions. [2019-12-07 10:33:26,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:33:26,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 10:33:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:33:28,253 INFO L225 Difference]: With dead ends: 544166 [2019-12-07 10:33:28,253 INFO L226 Difference]: Without dead ends: 544166 [2019-12-07 10:33:28,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:33:39,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544166 states. [2019-12-07 10:33:47,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544166 to 542792. [2019-12-07 10:33:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542792 states. [2019-12-07 10:33:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542792 states to 542792 states and 2491459 transitions. [2019-12-07 10:33:50,564 INFO L78 Accepts]: Start accepts. Automaton has 542792 states and 2491459 transitions. Word has length 21 [2019-12-07 10:33:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:33:50,564 INFO L462 AbstractCegarLoop]: Abstraction has 542792 states and 2491459 transitions. [2019-12-07 10:33:50,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:33:50,565 INFO L276 IsEmpty]: Start isEmpty. Operand 542792 states and 2491459 transitions. [2019-12-07 10:33:50,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:33:50,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:33:50,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:33:50,620 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:33:50,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:33:50,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1773629419, now seen corresponding path program 1 times [2019-12-07 10:33:50,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:33:50,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807097843] [2019-12-07 10:33:50,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:33:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:50,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807097843] [2019-12-07 10:33:50,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:33:50,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:33:50,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582163451] [2019-12-07 10:33:50,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:33:50,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:33:50,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:33:50,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:33:50,650 INFO L87 Difference]: Start difference. First operand 542792 states and 2491459 transitions. Second operand 3 states. [2019-12-07 10:33:57,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:33:57,579 INFO L93 Difference]: Finished difference Result 334440 states and 1384194 transitions. [2019-12-07 10:33:57,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:33:57,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 10:33:57,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:33:58,429 INFO L225 Difference]: With dead ends: 334440 [2019-12-07 10:33:58,429 INFO L226 Difference]: Without dead ends: 334440 [2019-12-07 10:33:58,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:34:04,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334440 states. [2019-12-07 10:34:08,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334440 to 334440. [2019-12-07 10:34:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334440 states. [2019-12-07 10:34:10,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334440 states to 334440 states and 1384194 transitions. [2019-12-07 10:34:10,254 INFO L78 Accepts]: Start accepts. Automaton has 334440 states and 1384194 transitions. Word has length 21 [2019-12-07 10:34:10,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:34:10,254 INFO L462 AbstractCegarLoop]: Abstraction has 334440 states and 1384194 transitions. [2019-12-07 10:34:10,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:34:10,254 INFO L276 IsEmpty]: Start isEmpty. Operand 334440 states and 1384194 transitions. [2019-12-07 10:34:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:34:10,284 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:34:10,285 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:34:10,285 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:34:10,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:34:10,285 INFO L82 PathProgramCache]: Analyzing trace with hash -441224904, now seen corresponding path program 1 times [2019-12-07 10:34:10,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:34:10,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724794181] [2019-12-07 10:34:10,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:34:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:34:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:34:10,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724794181] [2019-12-07 10:34:10,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:34:10,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:34:10,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455841411] [2019-12-07 10:34:10,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:34:10,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:34:10,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:34:10,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:34:10,320 INFO L87 Difference]: Start difference. First operand 334440 states and 1384194 transitions. Second operand 3 states. [2019-12-07 10:34:12,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:34:12,355 INFO L93 Difference]: Finished difference Result 334440 states and 1370962 transitions. [2019-12-07 10:34:12,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:34:12,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 10:34:12,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:34:13,203 INFO L225 Difference]: With dead ends: 334440 [2019-12-07 10:34:13,203 INFO L226 Difference]: Without dead ends: 334440 [2019-12-07 10:34:13,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:34:19,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334440 states. [2019-12-07 10:34:23,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334440 to 329548. [2019-12-07 10:34:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329548 states. [2019-12-07 10:34:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329548 states to 329548 states and 1352725 transitions. [2019-12-07 10:34:24,876 INFO L78 Accepts]: Start accepts. Automaton has 329548 states and 1352725 transitions. Word has length 22 [2019-12-07 10:34:24,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:34:24,877 INFO L462 AbstractCegarLoop]: Abstraction has 329548 states and 1352725 transitions. [2019-12-07 10:34:24,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:34:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand 329548 states and 1352725 transitions. [2019-12-07 10:34:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:34:24,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:34:24,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:34:24,903 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:34:24,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:34:24,903 INFO L82 PathProgramCache]: Analyzing trace with hash -2116532531, now seen corresponding path program 1 times [2019-12-07 10:34:24,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:34:24,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534599210] [2019-12-07 10:34:24,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:34:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:34:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:34:24,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534599210] [2019-12-07 10:34:24,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:34:24,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:34:24,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753298870] [2019-12-07 10:34:24,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:34:24,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:34:24,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:34:24,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:34:24,941 INFO L87 Difference]: Start difference. First operand 329548 states and 1352725 transitions. Second operand 5 states. [2019-12-07 10:34:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:34:30,583 INFO L93 Difference]: Finished difference Result 435596 states and 1758254 transitions. [2019-12-07 10:34:30,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:34:30,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 10:34:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:34:31,739 INFO L225 Difference]: With dead ends: 435596 [2019-12-07 10:34:31,739 INFO L226 Difference]: Without dead ends: 435037 [2019-12-07 10:34:31,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:34:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435037 states. [2019-12-07 10:34:44,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435037 to 344058. [2019-12-07 10:34:44,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344058 states. [2019-12-07 10:34:45,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344058 states to 344058 states and 1410060 transitions. [2019-12-07 10:34:45,440 INFO L78 Accepts]: Start accepts. Automaton has 344058 states and 1410060 transitions. Word has length 22 [2019-12-07 10:34:45,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:34:45,440 INFO L462 AbstractCegarLoop]: Abstraction has 344058 states and 1410060 transitions. [2019-12-07 10:34:45,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:34:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 344058 states and 1410060 transitions. [2019-12-07 10:34:45,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:34:45,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:34:45,468 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:34:45,468 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:34:45,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:34:45,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1596932964, now seen corresponding path program 1 times [2019-12-07 10:34:45,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:34:45,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582799992] [2019-12-07 10:34:45,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:34:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:34:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:34:45,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582799992] [2019-12-07 10:34:45,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:34:45,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:34:45,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462592107] [2019-12-07 10:34:45,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:34:45,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:34:45,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:34:45,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:34:45,505 INFO L87 Difference]: Start difference. First operand 344058 states and 1410060 transitions. Second operand 4 states. [2019-12-07 10:34:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:34:48,646 INFO L93 Difference]: Finished difference Result 572573 states and 2337276 transitions. [2019-12-07 10:34:48,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:34:48,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 10:34:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:34:50,055 INFO L225 Difference]: With dead ends: 572573 [2019-12-07 10:34:50,055 INFO L226 Difference]: Without dead ends: 341783 [2019-12-07 10:34:50,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:35:00,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341783 states. [2019-12-07 10:35:05,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341783 to 330966. [2019-12-07 10:35:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330966 states. [2019-12-07 10:35:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330966 states to 330966 states and 1337871 transitions. [2019-12-07 10:35:06,513 INFO L78 Accepts]: Start accepts. Automaton has 330966 states and 1337871 transitions. Word has length 22 [2019-12-07 10:35:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:06,514 INFO L462 AbstractCegarLoop]: Abstraction has 330966 states and 1337871 transitions. [2019-12-07 10:35:06,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:35:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 330966 states and 1337871 transitions. [2019-12-07 10:35:06,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 10:35:06,551 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:06,551 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 10:35:06,551 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:06,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:06,551 INFO L82 PathProgramCache]: Analyzing trace with hash 149935729, now seen corresponding path program 1 times [2019-12-07 10:35:06,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:06,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920648357] [2019-12-07 10:35:06,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:06,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:06,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920648357] [2019-12-07 10:35:06,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:06,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:35:06,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872223575] [2019-12-07 10:35:06,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:35:06,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:06,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:35:06,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:06,580 INFO L87 Difference]: Start difference. First operand 330966 states and 1337871 transitions. Second operand 4 states. [2019-12-07 10:35:06,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:06,866 INFO L93 Difference]: Finished difference Result 80241 states and 275912 transitions. [2019-12-07 10:35:06,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:35:06,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 10:35:06,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:07,002 INFO L225 Difference]: With dead ends: 80241 [2019-12-07 10:35:07,002 INFO L226 Difference]: Without dead ends: 80241 [2019-12-07 10:35:07,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80241 states. [2019-12-07 10:35:08,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80241 to 79305. [2019-12-07 10:35:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79305 states. [2019-12-07 10:35:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79305 states to 79305 states and 271808 transitions. [2019-12-07 10:35:08,735 INFO L78 Accepts]: Start accepts. Automaton has 79305 states and 271808 transitions. Word has length 23 [2019-12-07 10:35:08,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:08,735 INFO L462 AbstractCegarLoop]: Abstraction has 79305 states and 271808 transitions. [2019-12-07 10:35:08,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:35:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 79305 states and 271808 transitions. [2019-12-07 10:35:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 10:35:08,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:08,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:08,749 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:08,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1520730132, now seen corresponding path program 1 times [2019-12-07 10:35:08,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:08,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396530726] [2019-12-07 10:35:08,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:08,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396530726] [2019-12-07 10:35:08,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:08,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:35:08,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113602068] [2019-12-07 10:35:08,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:35:08,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:08,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:35:08,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:35:08,790 INFO L87 Difference]: Start difference. First operand 79305 states and 271808 transitions. Second operand 6 states. [2019-12-07 10:35:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:09,430 INFO L93 Difference]: Finished difference Result 106477 states and 356639 transitions. [2019-12-07 10:35:09,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:35:09,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 10:35:09,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:09,630 INFO L225 Difference]: With dead ends: 106477 [2019-12-07 10:35:09,631 INFO L226 Difference]: Without dead ends: 106250 [2019-12-07 10:35:09,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:35:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106250 states. [2019-12-07 10:35:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106250 to 83905. [2019-12-07 10:35:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83905 states. [2019-12-07 10:35:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83905 states to 83905 states and 286522 transitions. [2019-12-07 10:35:11,477 INFO L78 Accepts]: Start accepts. Automaton has 83905 states and 286522 transitions. Word has length 24 [2019-12-07 10:35:11,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:11,477 INFO L462 AbstractCegarLoop]: Abstraction has 83905 states and 286522 transitions. [2019-12-07 10:35:11,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:35:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 83905 states and 286522 transitions. [2019-12-07 10:35:11,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 10:35:11,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:11,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:11,492 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:11,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:11,492 INFO L82 PathProgramCache]: Analyzing trace with hash -212678054, now seen corresponding path program 2 times [2019-12-07 10:35:11,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:11,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654501083] [2019-12-07 10:35:11,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:11,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654501083] [2019-12-07 10:35:11,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:11,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:35:11,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912469046] [2019-12-07 10:35:11,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:35:11,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:11,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:35:11,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:35:11,537 INFO L87 Difference]: Start difference. First operand 83905 states and 286522 transitions. Second operand 6 states. [2019-12-07 10:35:12,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:12,410 INFO L93 Difference]: Finished difference Result 121052 states and 402830 transitions. [2019-12-07 10:35:12,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:35:12,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 10:35:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:12,626 INFO L225 Difference]: With dead ends: 121052 [2019-12-07 10:35:12,626 INFO L226 Difference]: Without dead ends: 120814 [2019-12-07 10:35:12,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:35:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120814 states. [2019-12-07 10:35:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120814 to 89401. [2019-12-07 10:35:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89401 states. [2019-12-07 10:35:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89401 states to 89401 states and 304063 transitions. [2019-12-07 10:35:14,481 INFO L78 Accepts]: Start accepts. Automaton has 89401 states and 304063 transitions. Word has length 24 [2019-12-07 10:35:14,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:14,481 INFO L462 AbstractCegarLoop]: Abstraction has 89401 states and 304063 transitions. [2019-12-07 10:35:14,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:35:14,481 INFO L276 IsEmpty]: Start isEmpty. Operand 89401 states and 304063 transitions. [2019-12-07 10:35:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:35:14,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:14,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:14,524 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:14,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:14,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1179330183, now seen corresponding path program 1 times [2019-12-07 10:35:14,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:14,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836457502] [2019-12-07 10:35:14,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:14,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836457502] [2019-12-07 10:35:14,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:14,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:35:14,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344900490] [2019-12-07 10:35:14,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:35:14,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:14,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:35:14,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:35:14,580 INFO L87 Difference]: Start difference. First operand 89401 states and 304063 transitions. Second operand 6 states. [2019-12-07 10:35:15,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:15,248 INFO L93 Difference]: Finished difference Result 116408 states and 387986 transitions. [2019-12-07 10:35:15,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:35:15,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-07 10:35:15,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:15,634 INFO L225 Difference]: With dead ends: 116408 [2019-12-07 10:35:15,634 INFO L226 Difference]: Without dead ends: 115657 [2019-12-07 10:35:15,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:35:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115657 states. [2019-12-07 10:35:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115657 to 92813. [2019-12-07 10:35:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92813 states. [2019-12-07 10:35:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92813 states to 92813 states and 315251 transitions. [2019-12-07 10:35:17,279 INFO L78 Accepts]: Start accepts. Automaton has 92813 states and 315251 transitions. Word has length 31 [2019-12-07 10:35:17,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:17,280 INFO L462 AbstractCegarLoop]: Abstraction has 92813 states and 315251 transitions. [2019-12-07 10:35:17,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:35:17,280 INFO L276 IsEmpty]: Start isEmpty. Operand 92813 states and 315251 transitions. [2019-12-07 10:35:17,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:35:17,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:17,333 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:17,333 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:17,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:17,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1043452722, now seen corresponding path program 1 times [2019-12-07 10:35:17,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:17,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29406595] [2019-12-07 10:35:17,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:17,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:17,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29406595] [2019-12-07 10:35:17,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:17,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:35:17,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537531313] [2019-12-07 10:35:17,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:35:17,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:17,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:35:17,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:17,383 INFO L87 Difference]: Start difference. First operand 92813 states and 315251 transitions. Second operand 4 states. [2019-12-07 10:35:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:17,692 INFO L93 Difference]: Finished difference Result 94140 states and 318351 transitions. [2019-12-07 10:35:17,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:35:17,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 10:35:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:18,001 INFO L225 Difference]: With dead ends: 94140 [2019-12-07 10:35:18,001 INFO L226 Difference]: Without dead ends: 90251 [2019-12-07 10:35:18,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:18,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90251 states. [2019-12-07 10:35:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90251 to 88616. [2019-12-07 10:35:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88616 states. [2019-12-07 10:35:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88616 states to 88616 states and 301987 transitions. [2019-12-07 10:35:19,434 INFO L78 Accepts]: Start accepts. Automaton has 88616 states and 301987 transitions. Word has length 33 [2019-12-07 10:35:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:19,434 INFO L462 AbstractCegarLoop]: Abstraction has 88616 states and 301987 transitions. [2019-12-07 10:35:19,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:35:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 88616 states and 301987 transitions. [2019-12-07 10:35:19,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:35:19,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:19,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:19,492 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:19,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:19,493 INFO L82 PathProgramCache]: Analyzing trace with hash -127004127, now seen corresponding path program 1 times [2019-12-07 10:35:19,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:19,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523401292] [2019-12-07 10:35:19,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:19,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523401292] [2019-12-07 10:35:19,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:19,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:35:19,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112180401] [2019-12-07 10:35:19,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:35:19,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:19,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:35:19,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:35:19,541 INFO L87 Difference]: Start difference. First operand 88616 states and 301987 transitions. Second operand 5 states. [2019-12-07 10:35:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:19,714 INFO L93 Difference]: Finished difference Result 45932 states and 161467 transitions. [2019-12-07 10:35:19,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:35:19,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 10:35:19,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:19,789 INFO L225 Difference]: With dead ends: 45932 [2019-12-07 10:35:19,789 INFO L226 Difference]: Without dead ends: 45816 [2019-12-07 10:35:19,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:35:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45816 states. [2019-12-07 10:35:20,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45816 to 33801. [2019-12-07 10:35:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33801 states. [2019-12-07 10:35:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33801 states to 33801 states and 113939 transitions. [2019-12-07 10:35:20,554 INFO L78 Accepts]: Start accepts. Automaton has 33801 states and 113939 transitions. Word has length 34 [2019-12-07 10:35:20,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:20,554 INFO L462 AbstractCegarLoop]: Abstraction has 33801 states and 113939 transitions. [2019-12-07 10:35:20,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:35:20,554 INFO L276 IsEmpty]: Start isEmpty. Operand 33801 states and 113939 transitions. [2019-12-07 10:35:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 10:35:20,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:20,589 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] [2019-12-07 10:35:20,589 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:20,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:20,589 INFO L82 PathProgramCache]: Analyzing trace with hash 730447546, now seen corresponding path program 1 times [2019-12-07 10:35:20,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:20,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797700966] [2019-12-07 10:35:20,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:20,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797700966] [2019-12-07 10:35:20,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:20,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:35:20,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336485561] [2019-12-07 10:35:20,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:35:20,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:20,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:35:20,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:35:20,659 INFO L87 Difference]: Start difference. First operand 33801 states and 113939 transitions. Second operand 7 states. [2019-12-07 10:35:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:21,204 INFO L93 Difference]: Finished difference Result 44009 states and 144481 transitions. [2019-12-07 10:35:21,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:35:21,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-07 10:35:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:21,267 INFO L225 Difference]: With dead ends: 44009 [2019-12-07 10:35:21,267 INFO L226 Difference]: Without dead ends: 43700 [2019-12-07 10:35:21,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:35:21,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43700 states. [2019-12-07 10:35:21,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43700 to 34676. [2019-12-07 10:35:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34676 states. [2019-12-07 10:35:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34676 states to 34676 states and 116676 transitions. [2019-12-07 10:35:21,894 INFO L78 Accepts]: Start accepts. Automaton has 34676 states and 116676 transitions. Word has length 43 [2019-12-07 10:35:21,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:21,894 INFO L462 AbstractCegarLoop]: Abstraction has 34676 states and 116676 transitions. [2019-12-07 10:35:21,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:35:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand 34676 states and 116676 transitions. [2019-12-07 10:35:21,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 10:35:21,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:21,930 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] [2019-12-07 10:35:21,931 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:21,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:21,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2106102698, now seen corresponding path program 2 times [2019-12-07 10:35:21,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:21,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631380198] [2019-12-07 10:35:21,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:21,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631380198] [2019-12-07 10:35:21,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:21,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:35:21,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903453596] [2019-12-07 10:35:21,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:35:21,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:21,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:35:21,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:35:21,991 INFO L87 Difference]: Start difference. First operand 34676 states and 116676 transitions. Second operand 7 states. [2019-12-07 10:35:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:22,674 INFO L93 Difference]: Finished difference Result 41859 states and 136732 transitions. [2019-12-07 10:35:22,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 10:35:22,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-07 10:35:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:22,732 INFO L225 Difference]: With dead ends: 41859 [2019-12-07 10:35:22,732 INFO L226 Difference]: Without dead ends: 41297 [2019-12-07 10:35:22,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:35:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41297 states. [2019-12-07 10:35:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41297 to 29868. [2019-12-07 10:35:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29868 states. [2019-12-07 10:35:23,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29868 states to 29868 states and 101097 transitions. [2019-12-07 10:35:23,424 INFO L78 Accepts]: Start accepts. Automaton has 29868 states and 101097 transitions. Word has length 43 [2019-12-07 10:35:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:23,424 INFO L462 AbstractCegarLoop]: Abstraction has 29868 states and 101097 transitions. [2019-12-07 10:35:23,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:35:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 29868 states and 101097 transitions. [2019-12-07 10:35:23,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 10:35:23,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:23,453 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] [2019-12-07 10:35:23,454 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:23,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1441960170, now seen corresponding path program 1 times [2019-12-07 10:35:23,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:23,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800927694] [2019-12-07 10:35:23,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:23,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:23,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800927694] [2019-12-07 10:35:23,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:23,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:35:23,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390595867] [2019-12-07 10:35:23,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:35:23,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:23,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:35:23,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:35:23,509 INFO L87 Difference]: Start difference. First operand 29868 states and 101097 transitions. Second operand 5 states. [2019-12-07 10:35:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:23,923 INFO L93 Difference]: Finished difference Result 46702 states and 156954 transitions. [2019-12-07 10:35:23,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:35:23,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-07 10:35:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:23,993 INFO L225 Difference]: With dead ends: 46702 [2019-12-07 10:35:23,993 INFO L226 Difference]: Without dead ends: 46702 [2019-12-07 10:35:23,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:35:24,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46702 states. [2019-12-07 10:35:24,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46702 to 38554. [2019-12-07 10:35:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38554 states. [2019-12-07 10:35:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38554 states to 38554 states and 130633 transitions. [2019-12-07 10:35:24,678 INFO L78 Accepts]: Start accepts. Automaton has 38554 states and 130633 transitions. Word has length 44 [2019-12-07 10:35:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:24,678 INFO L462 AbstractCegarLoop]: Abstraction has 38554 states and 130633 transitions. [2019-12-07 10:35:24,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:35:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 38554 states and 130633 transitions. [2019-12-07 10:35:24,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 10:35:24,719 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:24,719 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] [2019-12-07 10:35:24,719 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:24,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:24,719 INFO L82 PathProgramCache]: Analyzing trace with hash 707630878, now seen corresponding path program 2 times [2019-12-07 10:35:24,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:24,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32929372] [2019-12-07 10:35:24,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:24,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32929372] [2019-12-07 10:35:24,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:24,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:35:24,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74790622] [2019-12-07 10:35:24,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:24,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:24,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:24,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:24,748 INFO L87 Difference]: Start difference. First operand 38554 states and 130633 transitions. Second operand 3 states. [2019-12-07 10:35:24,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:24,851 INFO L93 Difference]: Finished difference Result 29868 states and 99933 transitions. [2019-12-07 10:35:24,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:24,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 10:35:24,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:24,894 INFO L225 Difference]: With dead ends: 29868 [2019-12-07 10:35:24,895 INFO L226 Difference]: Without dead ends: 29868 [2019-12-07 10:35:24,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29868 states. [2019-12-07 10:35:25,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29868 to 29569. [2019-12-07 10:35:25,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29569 states. [2019-12-07 10:35:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29569 states to 29569 states and 99062 transitions. [2019-12-07 10:35:25,376 INFO L78 Accepts]: Start accepts. Automaton has 29569 states and 99062 transitions. Word has length 44 [2019-12-07 10:35:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:25,376 INFO L462 AbstractCegarLoop]: Abstraction has 29569 states and 99062 transitions. [2019-12-07 10:35:25,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 29569 states and 99062 transitions. [2019-12-07 10:35:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 10:35:25,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:25,408 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] [2019-12-07 10:35:25,408 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:25,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:25,408 INFO L82 PathProgramCache]: Analyzing trace with hash -696296869, now seen corresponding path program 1 times [2019-12-07 10:35:25,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:25,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104018843] [2019-12-07 10:35:25,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:25,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104018843] [2019-12-07 10:35:25,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:25,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:35:25,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766238331] [2019-12-07 10:35:25,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:35:25,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:25,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:35:25,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:35:25,454 INFO L87 Difference]: Start difference. First operand 29569 states and 99062 transitions. Second operand 6 states. [2019-12-07 10:35:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:25,564 INFO L93 Difference]: Finished difference Result 27489 states and 94291 transitions. [2019-12-07 10:35:25,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:35:25,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-07 10:35:25,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:25,605 INFO L225 Difference]: With dead ends: 27489 [2019-12-07 10:35:25,605 INFO L226 Difference]: Without dead ends: 26513 [2019-12-07 10:35:25,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:35:25,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26513 states. [2019-12-07 10:35:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26513 to 19518. [2019-12-07 10:35:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19518 states. [2019-12-07 10:35:26,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19518 states to 19518 states and 69200 transitions. [2019-12-07 10:35:26,068 INFO L78 Accepts]: Start accepts. Automaton has 19518 states and 69200 transitions. Word has length 45 [2019-12-07 10:35:26,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:26,068 INFO L462 AbstractCegarLoop]: Abstraction has 19518 states and 69200 transitions. [2019-12-07 10:35:26,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:35:26,068 INFO L276 IsEmpty]: Start isEmpty. Operand 19518 states and 69200 transitions. [2019-12-07 10:35:26,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:35:26,086 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:26,086 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] [2019-12-07 10:35:26,086 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:26,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:26,087 INFO L82 PathProgramCache]: Analyzing trace with hash -205676228, now seen corresponding path program 1 times [2019-12-07 10:35:26,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:26,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973918124] [2019-12-07 10:35:26,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:26,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973918124] [2019-12-07 10:35:26,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:26,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:35:26,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334728739] [2019-12-07 10:35:26,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:26,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:26,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:26,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:26,112 INFO L87 Difference]: Start difference. First operand 19518 states and 69200 transitions. Second operand 3 states. [2019-12-07 10:35:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:26,207 INFO L93 Difference]: Finished difference Result 25109 states and 87343 transitions. [2019-12-07 10:35:26,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:26,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 10:35:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:26,247 INFO L225 Difference]: With dead ends: 25109 [2019-12-07 10:35:26,247 INFO L226 Difference]: Without dead ends: 25109 [2019-12-07 10:35:26,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25109 states. [2019-12-07 10:35:26,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25109 to 19726. [2019-12-07 10:35:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19726 states. [2019-12-07 10:35:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19726 states to 19726 states and 70117 transitions. [2019-12-07 10:35:26,621 INFO L78 Accepts]: Start accepts. Automaton has 19726 states and 70117 transitions. Word has length 59 [2019-12-07 10:35:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:26,621 INFO L462 AbstractCegarLoop]: Abstraction has 19726 states and 70117 transitions. [2019-12-07 10:35:26,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 19726 states and 70117 transitions. [2019-12-07 10:35:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:35:26,641 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:26,642 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:26,642 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:26,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:26,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1547307155, now seen corresponding path program 1 times [2019-12-07 10:35:26,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:26,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206839298] [2019-12-07 10:35:26,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:26,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206839298] [2019-12-07 10:35:26,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:26,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:35:26,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959766909] [2019-12-07 10:35:26,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:35:26,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:26,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:35:26,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:26,701 INFO L87 Difference]: Start difference. First operand 19726 states and 70117 transitions. Second operand 4 states. [2019-12-07 10:35:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:26,840 INFO L93 Difference]: Finished difference Result 44411 states and 154912 transitions. [2019-12-07 10:35:26,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:35:26,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 10:35:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:26,859 INFO L225 Difference]: With dead ends: 44411 [2019-12-07 10:35:26,859 INFO L226 Difference]: Without dead ends: 16728 [2019-12-07 10:35:26,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16728 states. [2019-12-07 10:35:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16728 to 9660. [2019-12-07 10:35:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9660 states. [2019-12-07 10:35:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9660 states to 9660 states and 29968 transitions. [2019-12-07 10:35:27,054 INFO L78 Accepts]: Start accepts. Automaton has 9660 states and 29968 transitions. Word has length 59 [2019-12-07 10:35:27,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:27,054 INFO L462 AbstractCegarLoop]: Abstraction has 9660 states and 29968 transitions. [2019-12-07 10:35:27,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:35:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 9660 states and 29968 transitions. [2019-12-07 10:35:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:35:27,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:27,063 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] [2019-12-07 10:35:27,063 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:27,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:27,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1265178387, now seen corresponding path program 2 times [2019-12-07 10:35:27,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:27,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060105744] [2019-12-07 10:35:27,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:35:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:35:27,134 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 10:35:27,134 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:35:27,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$mem_tmp~0_52 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t725~0.base_21|) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff1_thd0~0_155 0) (= v_~y$r_buff0_thd0~0_159 0) (= v_~y$w_buff1_used~0_637 0) (= v_~y$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_27) (= 0 v_~y$r_buff1_thd3~0_151) (= 0 v_~y$r_buff0_thd4~0_154) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_p3_EAX~0_27) (= 0 v_~y$r_buff0_thd2~0_336) (= 0 v_~y$r_buff1_thd4~0_190) (= v_~y~0_177 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$flush_delayed~0_106 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t725~0.base_21| 4)) (= v_~weak$$choice2~0_150 0) (= v_~y$w_buff1~0_392 0) (= 0 v_~y$r_buff1_thd2~0_255) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t725~0.base_21| 1)) (= 0 v_~y$r_buff0_thd3~0_211) (= v_~a~0_32 0) (= 0 |v_ULTIMATE.start_main_~#t725~0.offset_16|) (= v_~__unbuffered_cnt~0_242 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_105 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p1_EAX~0_27) (= (select .cse0 |v_ULTIMATE.start_main_~#t725~0.base_21|) 0) (= v_~y$w_buff0_used~0_880 0) (= 0 v_~y$w_buff0~0_485) (= 0 v_~weak$$choice0~0_13) (= 0 v_~y$r_buff1_thd1~0_85) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t725~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t725~0.base_21|) |v_ULTIMATE.start_main_~#t725~0.offset_16| 0)) |v_#memory_int_27|) (= v_~y$r_buff0_thd1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_92|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ULTIMATE.start_main_~#t726~0.offset=|v_ULTIMATE.start_main_~#t726~0.offset_17|, ~a~0=v_~a~0_32, ~y$mem_tmp~0=v_~y$mem_tmp~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_151, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_27, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t727~0.offset=|v_ULTIMATE.start_main_~#t727~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_190, ~y$w_buff1~0=v_~y$w_buff1~0_392, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t725~0.offset=|v_ULTIMATE.start_main_~#t725~0.offset_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t728~0.base=|v_ULTIMATE.start_main_~#t728~0.base_22|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_880, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_~#t728~0.offset=|v_ULTIMATE.start_main_~#t728~0.offset_17|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_52|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_52|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_211, ULTIMATE.start_main_~#t725~0.base=|v_ULTIMATE.start_main_~#t725~0.base_21|, ~y~0=v_~y~0_177, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t727~0.base=|v_ULTIMATE.start_main_~#t727~0.base_22|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_27, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_255, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_154, ULTIMATE.start_main_~#t726~0.base=|v_ULTIMATE.start_main_~#t726~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t726~0.offset, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t727~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t725~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t728~0.base, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t728~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t725~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t727~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t726~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:35:27,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L841-1-->L843: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t726~0.base_10| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t726~0.base_10|) |v_ULTIMATE.start_main_~#t726~0.offset_10| 1)) |v_#memory_int_21|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t726~0.base_10|) 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t726~0.base_10| 4) |v_#length_23|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t726~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t726~0.base_10| 0)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t726~0.base_10| 1) |v_#valid_41|) (= 0 |v_ULTIMATE.start_main_~#t726~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t726~0.offset=|v_ULTIMATE.start_main_~#t726~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t726~0.base=|v_ULTIMATE.start_main_~#t726~0.base_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t726~0.offset, ULTIMATE.start_main_~#t726~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 10:35:27,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L843-1-->L845: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t727~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t727~0.offset_10|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t727~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t727~0.base_11|) |v_ULTIMATE.start_main_~#t727~0.offset_10| 2))) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t727~0.base_11| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t727~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t727~0.base_11|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t727~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t727~0.offset=|v_ULTIMATE.start_main_~#t727~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t727~0.base=|v_ULTIMATE.start_main_~#t727~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t727~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t727~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 10:35:27,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L795: Formula: (and (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_44 1) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd4~0_33 v_~y$r_buff1_thd4~0_33) (= v_~y$r_buff0_thd3~0_45 v_~y$r_buff1_thd3~0_21) (= v_~z~0_14 1) (= v_~y$r_buff0_thd0~0_33 v_~y$r_buff1_thd0~0_32) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_44, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 10:35:27,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L845-1-->L847: Formula: (and (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t728~0.base_11|)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t728~0.base_11| 4) |v_#length_19|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t728~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t728~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t728~0.offset_10|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t728~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t728~0.base_11|) |v_ULTIMATE.start_main_~#t728~0.offset_10| 3)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t728~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t728~0.base=|v_ULTIMATE.start_main_~#t728~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t728~0.offset=|v_ULTIMATE.start_main_~#t728~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t728~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t728~0.offset] because there is no mapped edge [2019-12-07 10:35:27,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-2-->L818-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-1056552992 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1056552992 256))) (.cse1 (= |P3Thread1of1ForFork0_#t~ite33_Out-1056552992| |P3Thread1of1ForFork0_#t~ite32_Out-1056552992|))) (or (and (not .cse0) .cse1 (= ~y$w_buff1~0_In-1056552992 |P3Thread1of1ForFork0_#t~ite32_Out-1056552992|) (not .cse2)) (and (= ~y~0_In-1056552992 |P3Thread1of1ForFork0_#t~ite32_Out-1056552992|) (or .cse0 .cse2) .cse1))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1056552992, ~y$w_buff1~0=~y$w_buff1~0_In-1056552992, ~y~0=~y~0_In-1056552992, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1056552992} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1056552992, ~y$w_buff1~0=~y$w_buff1~0_In-1056552992, ~y~0=~y~0_In-1056552992, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-1056552992|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-1056552992|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1056552992} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 10:35:27,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~a~0_20 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a~0=v_~a~0_20, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_28, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} 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 10:35:27,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In2122881021 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2122881021 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out2122881021| ~y$w_buff0_used~0_In2122881021) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out2122881021| 0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2122881021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2122881021} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2122881021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2122881021, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out2122881021|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 10:35:27,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L820-->L820-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd4~0_In1810924553 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1810924553 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1810924553 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In1810924553 256) 0))) (or (and (= ~y$w_buff1_used~0_In1810924553 |P3Thread1of1ForFork0_#t~ite35_Out1810924553|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out1810924553|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1810924553, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1810924553, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1810924553, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1810924553} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1810924553, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1810924553, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1810924553, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out1810924553|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1810924553} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 10:35:27,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In129033139 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In129033139 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In129033139 |P3Thread1of1ForFork0_#t~ite36_Out129033139|)) (and (= 0 |P3Thread1of1ForFork0_#t~ite36_Out129033139|) (not .cse0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In129033139, ~y$w_buff0_used~0=~y$w_buff0_used~0_In129033139} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In129033139, ~y$w_buff0_used~0=~y$w_buff0_used~0_In129033139, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out129033139|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 10:35:27,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L822-->L822-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In193648112 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In193648112 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In193648112 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In193648112 256)))) (or (and (= ~y$r_buff1_thd4~0_In193648112 |P3Thread1of1ForFork0_#t~ite37_Out193648112|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork0_#t~ite37_Out193648112| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In193648112, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In193648112, ~y$w_buff0_used~0=~y$w_buff0_used~0_In193648112, ~y$w_buff1_used~0=~y$w_buff1_used~0_In193648112} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In193648112, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In193648112, ~y$w_buff0_used~0=~y$w_buff0_used~0_In193648112, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out193648112|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In193648112} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 10:35:27,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_40| v_~y$r_buff1_thd4~0_62) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_62, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_39|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 10:35:27,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L760-->L760-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In872344905 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_In872344905| |P1Thread1of1ForFork2_#t~ite11_Out872344905|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out872344905| ~y$w_buff1~0_In872344905)) (and (= ~y$w_buff1~0_In872344905 |P1Thread1of1ForFork2_#t~ite11_Out872344905|) (= |P1Thread1of1ForFork2_#t~ite12_Out872344905| |P1Thread1of1ForFork2_#t~ite11_Out872344905|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In872344905 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In872344905 256) 0)) (= (mod ~y$w_buff0_used~0_In872344905 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In872344905 256) 0)))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In872344905, ~y$w_buff1~0=~y$w_buff1~0_In872344905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In872344905, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In872344905, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In872344905|, ~weak$$choice2~0=~weak$$choice2~0_In872344905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In872344905} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In872344905, ~y$w_buff1~0=~y$w_buff1~0_In872344905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In872344905, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In872344905, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out872344905|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out872344905|, ~weak$$choice2~0=~weak$$choice2~0_In872344905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In872344905} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 10:35:27,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L761-->L761-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1060114942 256)))) (or (and .cse0 (= ~y$w_buff0_used~0_In-1060114942 |P1Thread1of1ForFork2_#t~ite14_Out-1060114942|) (= |P1Thread1of1ForFork2_#t~ite15_Out-1060114942| |P1Thread1of1ForFork2_#t~ite14_Out-1060114942|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1060114942 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1060114942 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1060114942 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1060114942 256) 0))))) (and (= |P1Thread1of1ForFork2_#t~ite14_In-1060114942| |P1Thread1of1ForFork2_#t~ite14_Out-1060114942|) (= ~y$w_buff0_used~0_In-1060114942 |P1Thread1of1ForFork2_#t~ite15_Out-1060114942|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1060114942, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1060114942, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1060114942, ~weak$$choice2~0=~weak$$choice2~0_In-1060114942, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-1060114942|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1060114942} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1060114942, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1060114942, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1060114942, ~weak$$choice2~0=~weak$$choice2~0_In-1060114942, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1060114942|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-1060114942|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1060114942} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 10:35:27,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L764: Formula: (and (= v_~y$r_buff0_thd2~0_95 v_~y$r_buff0_thd2~0_94) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_94, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_7|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 10:35:27,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1586811627 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite23_In-1586811627| |P1Thread1of1ForFork2_#t~ite23_Out-1586811627|) (= |P1Thread1of1ForFork2_#t~ite24_Out-1586811627| ~y$r_buff1_thd2~0_In-1586811627) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1586811627 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1586811627 256))) (and (= (mod ~y$w_buff1_used~0_In-1586811627 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1586811627 256)))) (= ~y$r_buff1_thd2~0_In-1586811627 |P1Thread1of1ForFork2_#t~ite23_Out-1586811627|) .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out-1586811627| |P1Thread1of1ForFork2_#t~ite23_Out-1586811627|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1586811627, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1586811627, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1586811627, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-1586811627|, ~weak$$choice2~0=~weak$$choice2~0_In-1586811627, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1586811627} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1586811627, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1586811627, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1586811627, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-1586811627|, ~weak$$choice2~0=~weak$$choice2~0_In-1586811627, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-1586811627|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1586811627} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 10:35:27,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L766-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_51 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~y~0=v_~y~0_51, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:35:27,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1958635042 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1958635042 256)))) (or (and (= 0 |P2Thread1of1ForFork3_#t~ite28_Out1958635042|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1958635042 |P2Thread1of1ForFork3_#t~ite28_Out1958635042|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1958635042, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1958635042} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1958635042, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1958635042, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out1958635042|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 10:35:27,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-565542111 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-565542111 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-565542111 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-565542111 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-565542111 |P2Thread1of1ForFork3_#t~ite29_Out-565542111|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-565542111|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-565542111, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-565542111, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-565542111, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-565542111} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-565542111, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-565542111, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-565542111, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-565542111|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-565542111} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 10:35:27,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L798-->L799: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1901918623 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1901918623 256))) (.cse1 (= ~y$r_buff0_thd3~0_In1901918623 ~y$r_buff0_thd3~0_Out1901918623))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= 0 ~y$r_buff0_thd3~0_Out1901918623)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1901918623, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1901918623} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out1901918623|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1901918623, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1901918623} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 10:35:27,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1440507735 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1440507735 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-1440507735 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1440507735 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite31_Out-1440507735| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite31_Out-1440507735| ~y$r_buff1_thd3~0_In-1440507735) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1440507735, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1440507735, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1440507735, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1440507735} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1440507735, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1440507735, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1440507735, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-1440507735|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1440507735} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 10:35:27,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L799-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_128 (+ v_~__unbuffered_cnt~0_129 1)) (= |v_P2Thread1of1ForFork3_#t~ite31_36| v_~y$r_buff1_thd3~0_60) (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_60, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 10:35:27,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L853: Formula: (and (= (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_30) 1 0)) 0 1) v_~main$tmp_guard0~0_10) (not (= (mod v_~main$tmp_guard0~0_10 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:35:27,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L853-2-->L853-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite43_Out-75436100| |ULTIMATE.start_main_#t~ite42_Out-75436100|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-75436100 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-75436100 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite42_Out-75436100| ~y$w_buff1~0_In-75436100) (not .cse1) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite42_Out-75436100| ~y~0_In-75436100) (or .cse1 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-75436100, ~y~0=~y~0_In-75436100, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-75436100, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-75436100} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-75436100, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-75436100|, ~y~0=~y~0_In-75436100, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-75436100|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-75436100, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-75436100} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 10:35:27,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1240675212 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1240675212 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1240675212|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1240675212| ~y$w_buff0_used~0_In-1240675212) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1240675212, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1240675212} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1240675212, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1240675212, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1240675212|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 10:35:27,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L855-->L855-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In-1899589401 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1899589401 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1899589401 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1899589401 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1899589401|)) (and (= ~y$w_buff1_used~0_In-1899589401 |ULTIMATE.start_main_#t~ite45_Out-1899589401|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1899589401, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1899589401, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1899589401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1899589401} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1899589401, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1899589401, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1899589401, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1899589401|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1899589401} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 10:35:27,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In606010521 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In606010521 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite46_Out606010521|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In606010521 |ULTIMATE.start_main_#t~ite46_Out606010521|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In606010521, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In606010521} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In606010521, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In606010521, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out606010521|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 10:35:27,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1491668254 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1491668254 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1491668254 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1491668254 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite47_Out-1491668254|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-1491668254 |ULTIMATE.start_main_#t~ite47_Out-1491668254|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1491668254, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1491668254, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1491668254, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1491668254} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1491668254, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1491668254, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1491668254|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1491668254, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1491668254} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 10:35:27,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_40|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_22) (= 0 v_~__unbuffered_p1_EAX~0_23) (= v_~x~0_41 2) (= v_~z~0_83 2) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_23)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:35:27,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:35:27 BasicIcfg [2019-12-07 10:35:27,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:35:27,206 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:35:27,206 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:35:27,206 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:35:27,207 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:30:53" (3/4) ... [2019-12-07 10:35:27,208 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:35:27,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$mem_tmp~0_52 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t725~0.base_21|) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff1_thd0~0_155 0) (= v_~y$r_buff0_thd0~0_159 0) (= v_~y$w_buff1_used~0_637 0) (= v_~y$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_27) (= 0 v_~y$r_buff1_thd3~0_151) (= 0 v_~y$r_buff0_thd4~0_154) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_p3_EAX~0_27) (= 0 v_~y$r_buff0_thd2~0_336) (= 0 v_~y$r_buff1_thd4~0_190) (= v_~y~0_177 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$flush_delayed~0_106 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t725~0.base_21| 4)) (= v_~weak$$choice2~0_150 0) (= v_~y$w_buff1~0_392 0) (= 0 v_~y$r_buff1_thd2~0_255) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t725~0.base_21| 1)) (= 0 v_~y$r_buff0_thd3~0_211) (= v_~a~0_32 0) (= 0 |v_ULTIMATE.start_main_~#t725~0.offset_16|) (= v_~__unbuffered_cnt~0_242 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_105 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p1_EAX~0_27) (= (select .cse0 |v_ULTIMATE.start_main_~#t725~0.base_21|) 0) (= v_~y$w_buff0_used~0_880 0) (= 0 v_~y$w_buff0~0_485) (= 0 v_~weak$$choice0~0_13) (= 0 v_~y$r_buff1_thd1~0_85) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t725~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t725~0.base_21|) |v_ULTIMATE.start_main_~#t725~0.offset_16| 0)) |v_#memory_int_27|) (= v_~y$r_buff0_thd1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_92|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ULTIMATE.start_main_~#t726~0.offset=|v_ULTIMATE.start_main_~#t726~0.offset_17|, ~a~0=v_~a~0_32, ~y$mem_tmp~0=v_~y$mem_tmp~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_151, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_27, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t727~0.offset=|v_ULTIMATE.start_main_~#t727~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_190, ~y$w_buff1~0=v_~y$w_buff1~0_392, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t725~0.offset=|v_ULTIMATE.start_main_~#t725~0.offset_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t728~0.base=|v_ULTIMATE.start_main_~#t728~0.base_22|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_880, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_~#t728~0.offset=|v_ULTIMATE.start_main_~#t728~0.offset_17|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_52|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_52|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_211, ULTIMATE.start_main_~#t725~0.base=|v_ULTIMATE.start_main_~#t725~0.base_21|, ~y~0=v_~y~0_177, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t727~0.base=|v_ULTIMATE.start_main_~#t727~0.base_22|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_27, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_255, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_154, ULTIMATE.start_main_~#t726~0.base=|v_ULTIMATE.start_main_~#t726~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t726~0.offset, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t727~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t725~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t728~0.base, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t728~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t725~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t727~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t726~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:35:27,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L841-1-->L843: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t726~0.base_10| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t726~0.base_10|) |v_ULTIMATE.start_main_~#t726~0.offset_10| 1)) |v_#memory_int_21|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t726~0.base_10|) 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t726~0.base_10| 4) |v_#length_23|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t726~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t726~0.base_10| 0)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t726~0.base_10| 1) |v_#valid_41|) (= 0 |v_ULTIMATE.start_main_~#t726~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t726~0.offset=|v_ULTIMATE.start_main_~#t726~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t726~0.base=|v_ULTIMATE.start_main_~#t726~0.base_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t726~0.offset, ULTIMATE.start_main_~#t726~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 10:35:27,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L843-1-->L845: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t727~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t727~0.offset_10|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t727~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t727~0.base_11|) |v_ULTIMATE.start_main_~#t727~0.offset_10| 2))) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t727~0.base_11| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t727~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t727~0.base_11|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t727~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t727~0.offset=|v_ULTIMATE.start_main_~#t727~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t727~0.base=|v_ULTIMATE.start_main_~#t727~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t727~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t727~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 10:35:27,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L795: Formula: (and (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_44 1) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd4~0_33 v_~y$r_buff1_thd4~0_33) (= v_~y$r_buff0_thd3~0_45 v_~y$r_buff1_thd3~0_21) (= v_~z~0_14 1) (= v_~y$r_buff0_thd0~0_33 v_~y$r_buff1_thd0~0_32) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_44, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 10:35:27,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L845-1-->L847: Formula: (and (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t728~0.base_11|)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t728~0.base_11| 4) |v_#length_19|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t728~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t728~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t728~0.offset_10|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t728~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t728~0.base_11|) |v_ULTIMATE.start_main_~#t728~0.offset_10| 3)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t728~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t728~0.base=|v_ULTIMATE.start_main_~#t728~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t728~0.offset=|v_ULTIMATE.start_main_~#t728~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t728~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t728~0.offset] because there is no mapped edge [2019-12-07 10:35:27,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-2-->L818-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-1056552992 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1056552992 256))) (.cse1 (= |P3Thread1of1ForFork0_#t~ite33_Out-1056552992| |P3Thread1of1ForFork0_#t~ite32_Out-1056552992|))) (or (and (not .cse0) .cse1 (= ~y$w_buff1~0_In-1056552992 |P3Thread1of1ForFork0_#t~ite32_Out-1056552992|) (not .cse2)) (and (= ~y~0_In-1056552992 |P3Thread1of1ForFork0_#t~ite32_Out-1056552992|) (or .cse0 .cse2) .cse1))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1056552992, ~y$w_buff1~0=~y$w_buff1~0_In-1056552992, ~y~0=~y~0_In-1056552992, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1056552992} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1056552992, ~y$w_buff1~0=~y$w_buff1~0_In-1056552992, ~y~0=~y~0_In-1056552992, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-1056552992|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-1056552992|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1056552992} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 10:35:27,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~a~0_20 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a~0=v_~a~0_20, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_28, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} 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 10:35:27,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In2122881021 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2122881021 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out2122881021| ~y$w_buff0_used~0_In2122881021) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out2122881021| 0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2122881021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2122881021} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2122881021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2122881021, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out2122881021|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 10:35:27,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L820-->L820-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd4~0_In1810924553 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1810924553 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1810924553 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In1810924553 256) 0))) (or (and (= ~y$w_buff1_used~0_In1810924553 |P3Thread1of1ForFork0_#t~ite35_Out1810924553|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out1810924553|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1810924553, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1810924553, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1810924553, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1810924553} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1810924553, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1810924553, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1810924553, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out1810924553|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1810924553} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 10:35:27,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In129033139 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In129033139 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In129033139 |P3Thread1of1ForFork0_#t~ite36_Out129033139|)) (and (= 0 |P3Thread1of1ForFork0_#t~ite36_Out129033139|) (not .cse0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In129033139, ~y$w_buff0_used~0=~y$w_buff0_used~0_In129033139} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In129033139, ~y$w_buff0_used~0=~y$w_buff0_used~0_In129033139, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out129033139|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 10:35:27,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L822-->L822-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In193648112 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In193648112 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In193648112 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In193648112 256)))) (or (and (= ~y$r_buff1_thd4~0_In193648112 |P3Thread1of1ForFork0_#t~ite37_Out193648112|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork0_#t~ite37_Out193648112| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In193648112, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In193648112, ~y$w_buff0_used~0=~y$w_buff0_used~0_In193648112, ~y$w_buff1_used~0=~y$w_buff1_used~0_In193648112} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In193648112, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In193648112, ~y$w_buff0_used~0=~y$w_buff0_used~0_In193648112, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out193648112|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In193648112} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 10:35:27,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_40| v_~y$r_buff1_thd4~0_62) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_62, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_39|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 10:35:27,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L760-->L760-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In872344905 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_In872344905| |P1Thread1of1ForFork2_#t~ite11_Out872344905|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out872344905| ~y$w_buff1~0_In872344905)) (and (= ~y$w_buff1~0_In872344905 |P1Thread1of1ForFork2_#t~ite11_Out872344905|) (= |P1Thread1of1ForFork2_#t~ite12_Out872344905| |P1Thread1of1ForFork2_#t~ite11_Out872344905|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In872344905 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In872344905 256) 0)) (= (mod ~y$w_buff0_used~0_In872344905 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In872344905 256) 0)))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In872344905, ~y$w_buff1~0=~y$w_buff1~0_In872344905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In872344905, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In872344905, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In872344905|, ~weak$$choice2~0=~weak$$choice2~0_In872344905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In872344905} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In872344905, ~y$w_buff1~0=~y$w_buff1~0_In872344905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In872344905, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In872344905, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out872344905|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out872344905|, ~weak$$choice2~0=~weak$$choice2~0_In872344905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In872344905} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 10:35:27,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L761-->L761-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1060114942 256)))) (or (and .cse0 (= ~y$w_buff0_used~0_In-1060114942 |P1Thread1of1ForFork2_#t~ite14_Out-1060114942|) (= |P1Thread1of1ForFork2_#t~ite15_Out-1060114942| |P1Thread1of1ForFork2_#t~ite14_Out-1060114942|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1060114942 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1060114942 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1060114942 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1060114942 256) 0))))) (and (= |P1Thread1of1ForFork2_#t~ite14_In-1060114942| |P1Thread1of1ForFork2_#t~ite14_Out-1060114942|) (= ~y$w_buff0_used~0_In-1060114942 |P1Thread1of1ForFork2_#t~ite15_Out-1060114942|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1060114942, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1060114942, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1060114942, ~weak$$choice2~0=~weak$$choice2~0_In-1060114942, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-1060114942|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1060114942} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1060114942, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1060114942, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1060114942, ~weak$$choice2~0=~weak$$choice2~0_In-1060114942, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1060114942|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-1060114942|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1060114942} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 10:35:27,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L764: Formula: (and (= v_~y$r_buff0_thd2~0_95 v_~y$r_buff0_thd2~0_94) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_94, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_7|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 10:35:27,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1586811627 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite23_In-1586811627| |P1Thread1of1ForFork2_#t~ite23_Out-1586811627|) (= |P1Thread1of1ForFork2_#t~ite24_Out-1586811627| ~y$r_buff1_thd2~0_In-1586811627) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1586811627 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1586811627 256))) (and (= (mod ~y$w_buff1_used~0_In-1586811627 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1586811627 256)))) (= ~y$r_buff1_thd2~0_In-1586811627 |P1Thread1of1ForFork2_#t~ite23_Out-1586811627|) .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out-1586811627| |P1Thread1of1ForFork2_#t~ite23_Out-1586811627|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1586811627, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1586811627, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1586811627, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-1586811627|, ~weak$$choice2~0=~weak$$choice2~0_In-1586811627, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1586811627} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1586811627, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1586811627, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1586811627, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-1586811627|, ~weak$$choice2~0=~weak$$choice2~0_In-1586811627, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-1586811627|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1586811627} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 10:35:27,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L766-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_51 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~y~0=v_~y~0_51, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:35:27,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1958635042 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1958635042 256)))) (or (and (= 0 |P2Thread1of1ForFork3_#t~ite28_Out1958635042|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1958635042 |P2Thread1of1ForFork3_#t~ite28_Out1958635042|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1958635042, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1958635042} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1958635042, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1958635042, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out1958635042|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 10:35:27,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-565542111 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-565542111 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-565542111 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-565542111 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-565542111 |P2Thread1of1ForFork3_#t~ite29_Out-565542111|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-565542111|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-565542111, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-565542111, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-565542111, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-565542111} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-565542111, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-565542111, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-565542111, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-565542111|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-565542111} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 10:35:27,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L798-->L799: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1901918623 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1901918623 256))) (.cse1 (= ~y$r_buff0_thd3~0_In1901918623 ~y$r_buff0_thd3~0_Out1901918623))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= 0 ~y$r_buff0_thd3~0_Out1901918623)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1901918623, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1901918623} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out1901918623|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1901918623, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1901918623} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 10:35:27,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1440507735 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1440507735 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-1440507735 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1440507735 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite31_Out-1440507735| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite31_Out-1440507735| ~y$r_buff1_thd3~0_In-1440507735) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1440507735, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1440507735, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1440507735, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1440507735} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1440507735, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1440507735, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1440507735, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-1440507735|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1440507735} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 10:35:27,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L799-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_128 (+ v_~__unbuffered_cnt~0_129 1)) (= |v_P2Thread1of1ForFork3_#t~ite31_36| v_~y$r_buff1_thd3~0_60) (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_60, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 10:35:27,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L853: Formula: (and (= (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_30) 1 0)) 0 1) v_~main$tmp_guard0~0_10) (not (= (mod v_~main$tmp_guard0~0_10 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:35:27,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L853-2-->L853-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite43_Out-75436100| |ULTIMATE.start_main_#t~ite42_Out-75436100|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-75436100 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-75436100 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite42_Out-75436100| ~y$w_buff1~0_In-75436100) (not .cse1) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite42_Out-75436100| ~y~0_In-75436100) (or .cse1 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-75436100, ~y~0=~y~0_In-75436100, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-75436100, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-75436100} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-75436100, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-75436100|, ~y~0=~y~0_In-75436100, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-75436100|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-75436100, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-75436100} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 10:35:27,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1240675212 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1240675212 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1240675212|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1240675212| ~y$w_buff0_used~0_In-1240675212) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1240675212, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1240675212} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1240675212, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1240675212, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1240675212|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 10:35:27,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L855-->L855-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In-1899589401 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1899589401 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1899589401 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1899589401 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1899589401|)) (and (= ~y$w_buff1_used~0_In-1899589401 |ULTIMATE.start_main_#t~ite45_Out-1899589401|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1899589401, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1899589401, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1899589401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1899589401} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1899589401, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1899589401, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1899589401, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1899589401|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1899589401} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 10:35:27,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In606010521 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In606010521 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite46_Out606010521|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In606010521 |ULTIMATE.start_main_#t~ite46_Out606010521|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In606010521, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In606010521} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In606010521, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In606010521, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out606010521|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 10:35:27,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1491668254 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1491668254 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1491668254 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1491668254 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite47_Out-1491668254|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-1491668254 |ULTIMATE.start_main_#t~ite47_Out-1491668254|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1491668254, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1491668254, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1491668254, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1491668254} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1491668254, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1491668254, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1491668254|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1491668254, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1491668254} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 10:35:27,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_40|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_22) (= 0 v_~__unbuffered_p1_EAX~0_23) (= v_~x~0_41 2) (= v_~z~0_83 2) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_23)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:35:27,280 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6ca1f363-8431-4dd1-a805-943fba8dd12d/bin/utaipan/witness.graphml [2019-12-07 10:35:27,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:35:27,281 INFO L168 Benchmark]: Toolchain (without parser) took 275093.17 ms. Allocated memory was 1.0 GB in the beginning and 10.5 GB in the end (delta: 9.5 GB). Free memory was 942.4 MB in the beginning and 4.9 GB in the end (delta: -3.9 GB). Peak memory consumption was 5.5 GB. Max. memory is 11.5 GB. [2019-12-07 10:35:27,281 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:35:27,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -114.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:35:27,282 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:35:27,282 INFO L168 Benchmark]: Boogie Preprocessor took 27.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:35:27,282 INFO L168 Benchmark]: RCFGBuilder took 409.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:35:27,283 INFO L168 Benchmark]: TraceAbstraction took 274151.31 ms. Allocated memory was 1.1 GB in the beginning and 10.5 GB in the end (delta: 9.4 GB). Free memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: -3.9 GB). Peak memory consumption was 5.5 GB. Max. memory is 11.5 GB. [2019-12-07 10:35:27,283 INFO L168 Benchmark]: Witness Printer took 74.28 ms. Allocated memory is still 10.5 GB. Free memory was 4.9 GB in the beginning and 4.9 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:35:27,284 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -114.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 409.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 274151.31 ms. Allocated memory was 1.1 GB in the beginning and 10.5 GB in the end (delta: 9.4 GB). Free memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: -3.9 GB). Peak memory consumption was 5.5 GB. Max. memory is 11.5 GB. * Witness Printer took 74.28 ms. Allocated memory is still 10.5 GB. Free memory was 4.9 GB in the beginning and 4.9 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 180 ProgramPointsBefore, 90 ProgramPointsAfterwards, 208 TransitionsBefore, 97 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 274 VarBasedMoverChecksNegative, 123 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 74757 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t725, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] FCALL, FORK 0 pthread_create(&t726, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t727, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L847] FCALL, FORK 0 pthread_create(&t728, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 4 z = 2 [L812] 4 __unbuffered_p3_EAX = z [L815] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L751] 2 x = 2 [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L853] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 273.9s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 63.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3873 SDtfs, 4036 SDslu, 6690 SDs, 0 SdLazy, 3850 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 26 SyntacticMatches, 9 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=544510occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 171.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 407915 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 746 NumberOfCodeBlocks, 746 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 664 ConstructedInterpolants, 0 QuantifiedInterpolants, 124568 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...