./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe026_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5c9e5656-3a6a-4d3a-ab31-f0508c55a1d3/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5c9e5656-3a6a-4d3a-ab31-f0508c55a1d3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5c9e5656-3a6a-4d3a-ab31-f0508c55a1d3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5c9e5656-3a6a-4d3a-ab31-f0508c55a1d3/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe026_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5c9e5656-3a6a-4d3a-ab31-f0508c55a1d3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5c9e5656-3a6a-4d3a-ab31-f0508c55a1d3/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 3eee31809677f2d63a4c792c4c8ac046eb993097 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:19:16,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:19:16,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:19:16,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:19:16,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:19:16,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:19:16,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:19:16,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:19:16,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:19:16,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:19:16,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:19:16,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:19:16,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:19:16,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:19:16,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:19:16,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:19:16,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:19:16,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:19:16,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:19:16,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:19:16,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:19:16,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:19:16,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:19:16,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:19:16,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:19:16,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:19:16,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:19:16,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:19:16,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:19:16,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:19:16,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:19:16,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:19:16,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:19:16,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:19:16,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:19:16,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:19:16,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:19:16,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:19:16,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:19:16,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:19:16,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:19:16,970 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5c9e5656-3a6a-4d3a-ab31-f0508c55a1d3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:19:16,983 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:19:16,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:19:16,984 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:19:16,984 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:19:16,984 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:19:16,984 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:19:16,984 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:19:16,985 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:19:16,985 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:19:16,985 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:19:16,985 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:19:16,985 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:19:16,986 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:19:16,986 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:19:16,986 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:19:16,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:19:16,987 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:19:16,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:19:16,987 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:19:16,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:19:16,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:19:16,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:19:16,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:19:16,988 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:19:16,988 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:19:16,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:19:16,988 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:19:16,989 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:19:16,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:19:16,989 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:19:16,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:19:16,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:19:16,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:19:16,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:19:16,990 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:19:16,990 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:19:16,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:19:16,990 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:19:16,991 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:19:16,991 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:19:16,991 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_5c9e5656-3a6a-4d3a-ab31-f0508c55a1d3/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 -> 3eee31809677f2d63a4c792c4c8ac046eb993097 [2019-12-07 12:19:17,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:19:17,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:19:17,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:19:17,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:19:17,103 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:19:17,104 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5c9e5656-3a6a-4d3a-ab31-f0508c55a1d3/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe026_power.opt.i [2019-12-07 12:19:17,145 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c9e5656-3a6a-4d3a-ab31-f0508c55a1d3/bin/utaipan/data/493b6e96d/c12099704ffe4870857ad41d73352137/FLAG328e89f1b [2019-12-07 12:19:17,582 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:19:17,583 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5c9e5656-3a6a-4d3a-ab31-f0508c55a1d3/sv-benchmarks/c/pthread-wmm/safe026_power.opt.i [2019-12-07 12:19:17,595 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c9e5656-3a6a-4d3a-ab31-f0508c55a1d3/bin/utaipan/data/493b6e96d/c12099704ffe4870857ad41d73352137/FLAG328e89f1b [2019-12-07 12:19:17,604 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5c9e5656-3a6a-4d3a-ab31-f0508c55a1d3/bin/utaipan/data/493b6e96d/c12099704ffe4870857ad41d73352137 [2019-12-07 12:19:17,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:19:17,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:19:17,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:19:17,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:19:17,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:19:17,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:19:17" (1/1) ... [2019-12-07 12:19:17,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:19:17, skipping insertion in model container [2019-12-07 12:19:17,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:19:17" (1/1) ... [2019-12-07 12:19:17,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:19:17,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:19:17,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:19:17,905 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:19:17,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:19:17,993 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:19:17,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:19:17 WrapperNode [2019-12-07 12:19:17,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:19:17,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:19:17,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:19:17,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:19:18,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:19:17" (1/1) ... [2019-12-07 12:19:18,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:19:17" (1/1) ... [2019-12-07 12:19:18,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:19:18,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:19:18,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:19:18,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:19:18,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:19:17" (1/1) ... [2019-12-07 12:19:18,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:19:17" (1/1) ... [2019-12-07 12:19:18,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:19:17" (1/1) ... [2019-12-07 12:19:18,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:19:17" (1/1) ... [2019-12-07 12:19:18,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:19:17" (1/1) ... [2019-12-07 12:19:18,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:19:17" (1/1) ... [2019-12-07 12:19:18,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:19:17" (1/1) ... [2019-12-07 12:19:18,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:19:18,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:19:18,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:19:18,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:19:18,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:19:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c9e5656-3a6a-4d3a-ab31-f0508c55a1d3/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:19:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:19:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:19:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:19:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:19:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:19:18,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:19:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:19:18,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:19:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 12:19:18,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 12:19:18,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:19:18,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:19:18,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:19:18,108 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 12:19:18,482 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:19:18,482 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:19:18,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:19:18 BoogieIcfgContainer [2019-12-07 12:19:18,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:19:18,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:19:18,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:19:18,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:19:18,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:19:17" (1/3) ... [2019-12-07 12:19:18,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2714297f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:19:18, skipping insertion in model container [2019-12-07 12:19:18,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:19:17" (2/3) ... [2019-12-07 12:19:18,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2714297f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:19:18, skipping insertion in model container [2019-12-07 12:19:18,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:19:18" (3/3) ... [2019-12-07 12:19:18,488 INFO L109 eAbstractionObserver]: Analyzing ICFG safe026_power.opt.i [2019-12-07 12:19:18,494 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:19:18,494 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:19:18,499 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:19:18,500 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:19:18,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,525 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,525 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,525 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,525 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,526 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,529 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,529 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,533 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,534 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:19:18,556 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 12:19:18,568 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:19:18,568 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:19:18,568 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:19:18,568 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:19:18,568 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:19:18,568 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:19:18,568 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:19:18,568 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:19:18,580 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-07 12:19:18,581 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-07 12:19:18,635 INFO L134 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-07 12:19:18,635 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:19:18,646 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 12:19:18,661 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-07 12:19:18,689 INFO L134 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-07 12:19:18,689 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:19:18,694 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 12:19:18,710 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 12:19:18,711 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:19:21,657 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 12:19:21,753 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78269 [2019-12-07 12:19:21,753 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 12:19:21,755 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 103 transitions [2019-12-07 12:19:34,906 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-07 12:19:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-07 12:19:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:19:34,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:19:34,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:19:34,912 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:19:34,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:19:34,916 INFO L82 PathProgramCache]: Analyzing trace with hash 909914, now seen corresponding path program 1 times [2019-12-07 12:19:34,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:19:34,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857975761] [2019-12-07 12:19:34,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:19:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:19:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:19:35,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857975761] [2019-12-07 12:19:35,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:19:35,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:19:35,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037592835] [2019-12-07 12:19:35,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:19:35,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:19:35,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:19:35,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:19:35,070 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-07 12:19:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:19:35,775 INFO L93 Difference]: Finished difference Result 108680 states and 463562 transitions. [2019-12-07 12:19:35,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:19:35,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 12:19:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:19:36,388 INFO L225 Difference]: With dead ends: 108680 [2019-12-07 12:19:36,388 INFO L226 Difference]: Without dead ends: 102440 [2019-12-07 12:19:36,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:19:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102440 states. [2019-12-07 12:19:41,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102440 to 102440. [2019-12-07 12:19:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102440 states. [2019-12-07 12:19:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102440 states to 102440 states and 436366 transitions. [2019-12-07 12:19:41,720 INFO L78 Accepts]: Start accepts. Automaton has 102440 states and 436366 transitions. Word has length 3 [2019-12-07 12:19:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:19:41,721 INFO L462 AbstractCegarLoop]: Abstraction has 102440 states and 436366 transitions. [2019-12-07 12:19:41,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:19:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 102440 states and 436366 transitions. [2019-12-07 12:19:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:19:41,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:19:41,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:19:41,725 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:19:41,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:19:41,725 INFO L82 PathProgramCache]: Analyzing trace with hash -975068220, now seen corresponding path program 1 times [2019-12-07 12:19:41,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:19:41,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333940801] [2019-12-07 12:19:41,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:19:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:19:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:19:41,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333940801] [2019-12-07 12:19:41,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:19:41,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:19:41,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6330801] [2019-12-07 12:19:41,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:19:41,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:19:41,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:19:41,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:19:41,803 INFO L87 Difference]: Start difference. First operand 102440 states and 436366 transitions. Second operand 4 states. [2019-12-07 12:19:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:19:44,693 INFO L93 Difference]: Finished difference Result 163248 states and 665679 transitions. [2019-12-07 12:19:44,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:19:44,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:19:44,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:19:45,096 INFO L225 Difference]: With dead ends: 163248 [2019-12-07 12:19:45,096 INFO L226 Difference]: Without dead ends: 163199 [2019-12-07 12:19:45,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:19:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163199 states. [2019-12-07 12:19:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163199 to 148639. [2019-12-07 12:19:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148639 states. [2019-12-07 12:19:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148639 states to 148639 states and 614105 transitions. [2019-12-07 12:19:52,248 INFO L78 Accepts]: Start accepts. Automaton has 148639 states and 614105 transitions. Word has length 11 [2019-12-07 12:19:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:19:52,248 INFO L462 AbstractCegarLoop]: Abstraction has 148639 states and 614105 transitions. [2019-12-07 12:19:52,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:19:52,248 INFO L276 IsEmpty]: Start isEmpty. Operand 148639 states and 614105 transitions. [2019-12-07 12:19:52,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:19:52,252 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:19:52,252 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:19:52,252 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:19:52,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:19:52,252 INFO L82 PathProgramCache]: Analyzing trace with hash -112330344, now seen corresponding path program 1 times [2019-12-07 12:19:52,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:19:52,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759585418] [2019-12-07 12:19:52,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:19:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:19:52,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:19:52,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759585418] [2019-12-07 12:19:52,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:19:52,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:19:52,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246328931] [2019-12-07 12:19:52,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:19:52,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:19:52,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:19:52,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:19:52,313 INFO L87 Difference]: Start difference. First operand 148639 states and 614105 transitions. Second operand 4 states. [2019-12-07 12:19:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:19:52,473 INFO L93 Difference]: Finished difference Result 43706 states and 149507 transitions. [2019-12-07 12:19:52,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:19:52,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 12:19:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:19:52,529 INFO L225 Difference]: With dead ends: 43706 [2019-12-07 12:19:52,529 INFO L226 Difference]: Without dead ends: 33577 [2019-12-07 12:19:52,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:19:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33577 states. [2019-12-07 12:19:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33577 to 33481. [2019-12-07 12:19:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33481 states. [2019-12-07 12:19:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33481 states to 33481 states and 108822 transitions. [2019-12-07 12:19:53,091 INFO L78 Accepts]: Start accepts. Automaton has 33481 states and 108822 transitions. Word has length 13 [2019-12-07 12:19:53,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:19:53,092 INFO L462 AbstractCegarLoop]: Abstraction has 33481 states and 108822 transitions. [2019-12-07 12:19:53,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:19:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 33481 states and 108822 transitions. [2019-12-07 12:19:53,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:19:53,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:19:53,094 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:19:53,094 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:19:53,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:19:53,095 INFO L82 PathProgramCache]: Analyzing trace with hash -790185689, now seen corresponding path program 1 times [2019-12-07 12:19:53,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:19:53,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388122712] [2019-12-07 12:19:53,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:19:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:19:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:19:53,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388122712] [2019-12-07 12:19:53,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:19:53,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:19:53,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424778465] [2019-12-07 12:19:53,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:19:53,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:19:53,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:19:53,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:19:53,156 INFO L87 Difference]: Start difference. First operand 33481 states and 108822 transitions. Second operand 5 states. [2019-12-07 12:19:53,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:19:53,461 INFO L93 Difference]: Finished difference Result 45175 states and 144711 transitions. [2019-12-07 12:19:53,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:19:53,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 12:19:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:19:53,532 INFO L225 Difference]: With dead ends: 45175 [2019-12-07 12:19:53,532 INFO L226 Difference]: Without dead ends: 45175 [2019-12-07 12:19:53,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:19:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45175 states. [2019-12-07 12:19:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45175 to 38347. [2019-12-07 12:19:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38347 states. [2019-12-07 12:19:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38347 states to 38347 states and 123865 transitions. [2019-12-07 12:19:54,529 INFO L78 Accepts]: Start accepts. Automaton has 38347 states and 123865 transitions. Word has length 16 [2019-12-07 12:19:54,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:19:54,529 INFO L462 AbstractCegarLoop]: Abstraction has 38347 states and 123865 transitions. [2019-12-07 12:19:54,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:19:54,530 INFO L276 IsEmpty]: Start isEmpty. Operand 38347 states and 123865 transitions. [2019-12-07 12:19:54,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:19:54,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:19:54,536 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:19:54,536 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:19:54,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:19:54,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2079194331, now seen corresponding path program 1 times [2019-12-07 12:19:54,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:19:54,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149876026] [2019-12-07 12:19:54,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:19:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:19:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:19:54,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149876026] [2019-12-07 12:19:54,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:19:54,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:19:54,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141486327] [2019-12-07 12:19:54,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:19:54,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:19:54,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:19:54,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:19:54,607 INFO L87 Difference]: Start difference. First operand 38347 states and 123865 transitions. Second operand 6 states. [2019-12-07 12:19:55,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:19:55,211 INFO L93 Difference]: Finished difference Result 58112 states and 182585 transitions. [2019-12-07 12:19:55,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:19:55,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 12:19:55,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:19:55,295 INFO L225 Difference]: With dead ends: 58112 [2019-12-07 12:19:55,295 INFO L226 Difference]: Without dead ends: 58056 [2019-12-07 12:19:55,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:19:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58056 states. [2019-12-07 12:19:55,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58056 to 38947. [2019-12-07 12:19:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38947 states. [2019-12-07 12:19:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38947 states to 38947 states and 124912 transitions. [2019-12-07 12:19:56,053 INFO L78 Accepts]: Start accepts. Automaton has 38947 states and 124912 transitions. Word has length 22 [2019-12-07 12:19:56,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:19:56,053 INFO L462 AbstractCegarLoop]: Abstraction has 38947 states and 124912 transitions. [2019-12-07 12:19:56,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:19:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 38947 states and 124912 transitions. [2019-12-07 12:19:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:19:56,062 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:19:56,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:19:56,063 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:19:56,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:19:56,063 INFO L82 PathProgramCache]: Analyzing trace with hash -356343789, now seen corresponding path program 1 times [2019-12-07 12:19:56,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:19:56,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762696751] [2019-12-07 12:19:56,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:19:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:19:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:19:56,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762696751] [2019-12-07 12:19:56,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:19:56,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:19:56,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245179962] [2019-12-07 12:19:56,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:19:56,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:19:56,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:19:56,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:19:56,126 INFO L87 Difference]: Start difference. First operand 38947 states and 124912 transitions. Second operand 5 states. [2019-12-07 12:19:56,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:19:56,204 INFO L93 Difference]: Finished difference Result 17807 states and 53973 transitions. [2019-12-07 12:19:56,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:19:56,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 12:19:56,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:19:56,222 INFO L225 Difference]: With dead ends: 17807 [2019-12-07 12:19:56,222 INFO L226 Difference]: Without dead ends: 15537 [2019-12-07 12:19:56,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:19:56,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15537 states. [2019-12-07 12:19:56,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15537 to 15208. [2019-12-07 12:19:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15208 states. [2019-12-07 12:19:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15208 states to 15208 states and 46078 transitions. [2019-12-07 12:19:56,435 INFO L78 Accepts]: Start accepts. Automaton has 15208 states and 46078 transitions. Word has length 25 [2019-12-07 12:19:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:19:56,435 INFO L462 AbstractCegarLoop]: Abstraction has 15208 states and 46078 transitions. [2019-12-07 12:19:56,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:19:56,436 INFO L276 IsEmpty]: Start isEmpty. Operand 15208 states and 46078 transitions. [2019-12-07 12:19:56,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:19:56,445 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:19:56,445 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] [2019-12-07 12:19:56,445 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:19:56,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:19:56,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1041381309, now seen corresponding path program 1 times [2019-12-07 12:19:56,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:19:56,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415066332] [2019-12-07 12:19:56,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:19:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:19:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:19:56,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415066332] [2019-12-07 12:19:56,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:19:56,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:19:56,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607658362] [2019-12-07 12:19:56,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:19:56,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:19:56,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:19:56,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:19:56,508 INFO L87 Difference]: Start difference. First operand 15208 states and 46078 transitions. Second operand 6 states. [2019-12-07 12:19:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:19:56,906 INFO L93 Difference]: Finished difference Result 21807 states and 64079 transitions. [2019-12-07 12:19:56,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:19:56,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 12:19:56,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:19:56,927 INFO L225 Difference]: With dead ends: 21807 [2019-12-07 12:19:56,927 INFO L226 Difference]: Without dead ends: 21497 [2019-12-07 12:19:56,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 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 12:19:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21497 states. [2019-12-07 12:19:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21497 to 17340. [2019-12-07 12:19:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17340 states. [2019-12-07 12:19:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17340 states to 17340 states and 51993 transitions. [2019-12-07 12:19:57,187 INFO L78 Accepts]: Start accepts. Automaton has 17340 states and 51993 transitions. Word has length 27 [2019-12-07 12:19:57,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:19:57,187 INFO L462 AbstractCegarLoop]: Abstraction has 17340 states and 51993 transitions. [2019-12-07 12:19:57,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:19:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 17340 states and 51993 transitions. [2019-12-07 12:19:57,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:19:57,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:19:57,201 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 12:19:57,201 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:19:57,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:19:57,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1993081713, now seen corresponding path program 1 times [2019-12-07 12:19:57,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:19:57,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902938139] [2019-12-07 12:19:57,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:19:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:19:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:19:57,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902938139] [2019-12-07 12:19:57,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:19:57,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:19:57,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347501523] [2019-12-07 12:19:57,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:19:57,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:19:57,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:19:57,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:19:57,445 INFO L87 Difference]: Start difference. First operand 17340 states and 51993 transitions. Second operand 7 states. [2019-12-07 12:19:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:19:58,160 INFO L93 Difference]: Finished difference Result 24233 states and 70715 transitions. [2019-12-07 12:19:58,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 12:19:58,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 12:19:58,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:19:58,183 INFO L225 Difference]: With dead ends: 24233 [2019-12-07 12:19:58,183 INFO L226 Difference]: Without dead ends: 23546 [2019-12-07 12:19:58,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:19:58,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23546 states. [2019-12-07 12:19:58,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23546 to 16133. [2019-12-07 12:19:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16133 states. [2019-12-07 12:19:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16133 states to 16133 states and 48316 transitions. [2019-12-07 12:19:58,448 INFO L78 Accepts]: Start accepts. Automaton has 16133 states and 48316 transitions. Word has length 33 [2019-12-07 12:19:58,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:19:58,449 INFO L462 AbstractCegarLoop]: Abstraction has 16133 states and 48316 transitions. [2019-12-07 12:19:58,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:19:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 16133 states and 48316 transitions. [2019-12-07 12:19:58,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 12:19:58,467 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:19:58,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:19:58,467 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:19:58,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:19:58,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2090975987, now seen corresponding path program 1 times [2019-12-07 12:19:58,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:19:58,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132458217] [2019-12-07 12:19:58,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:19:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:19:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:19:58,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132458217] [2019-12-07 12:19:58,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:19:58,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:19:58,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955787568] [2019-12-07 12:19:58,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:19:58,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:19:58,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:19:58,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:19:58,524 INFO L87 Difference]: Start difference. First operand 16133 states and 48316 transitions. Second operand 5 states. [2019-12-07 12:19:58,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:19:58,912 INFO L93 Difference]: Finished difference Result 23124 states and 68847 transitions. [2019-12-07 12:19:58,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:19:58,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 12:19:58,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:19:58,937 INFO L225 Difference]: With dead ends: 23124 [2019-12-07 12:19:58,937 INFO L226 Difference]: Without dead ends: 23124 [2019-12-07 12:19:58,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:19:59,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23124 states. [2019-12-07 12:19:59,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23124 to 21538. [2019-12-07 12:19:59,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21538 states. [2019-12-07 12:19:59,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21538 states to 21538 states and 64519 transitions. [2019-12-07 12:19:59,234 INFO L78 Accepts]: Start accepts. Automaton has 21538 states and 64519 transitions. Word has length 39 [2019-12-07 12:19:59,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:19:59,235 INFO L462 AbstractCegarLoop]: Abstraction has 21538 states and 64519 transitions. [2019-12-07 12:19:59,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:19:59,235 INFO L276 IsEmpty]: Start isEmpty. Operand 21538 states and 64519 transitions. [2019-12-07 12:19:59,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 12:19:59,258 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:19:59,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:19:59,258 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:19:59,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:19:59,258 INFO L82 PathProgramCache]: Analyzing trace with hash 166492821, now seen corresponding path program 2 times [2019-12-07 12:19:59,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:19:59,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834926684] [2019-12-07 12:19:59,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:19:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:19:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:19:59,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834926684] [2019-12-07 12:19:59,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:19:59,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:19:59,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860823260] [2019-12-07 12:19:59,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:19:59,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:19:59,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:19:59,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:19:59,304 INFO L87 Difference]: Start difference. First operand 21538 states and 64519 transitions. Second operand 3 states. [2019-12-07 12:19:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:19:59,355 INFO L93 Difference]: Finished difference Result 21538 states and 63846 transitions. [2019-12-07 12:19:59,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:19:59,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 12:19:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:19:59,377 INFO L225 Difference]: With dead ends: 21538 [2019-12-07 12:19:59,377 INFO L226 Difference]: Without dead ends: 21538 [2019-12-07 12:19:59,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:19:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21538 states. [2019-12-07 12:19:59,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21538 to 21422. [2019-12-07 12:19:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21422 states. [2019-12-07 12:19:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21422 states to 21422 states and 63524 transitions. [2019-12-07 12:19:59,651 INFO L78 Accepts]: Start accepts. Automaton has 21422 states and 63524 transitions. Word has length 39 [2019-12-07 12:19:59,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:19:59,651 INFO L462 AbstractCegarLoop]: Abstraction has 21422 states and 63524 transitions. [2019-12-07 12:19:59,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:19:59,651 INFO L276 IsEmpty]: Start isEmpty. Operand 21422 states and 63524 transitions. [2019-12-07 12:19:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 12:19:59,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:19:59,668 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] [2019-12-07 12:19:59,668 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:19:59,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:19:59,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1263660176, now seen corresponding path program 1 times [2019-12-07 12:19:59,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:19:59,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215450663] [2019-12-07 12:19:59,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:19:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:19:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:19:59,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215450663] [2019-12-07 12:19:59,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:19:59,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:19:59,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826334431] [2019-12-07 12:19:59,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:19:59,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:19:59,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:19:59,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:19:59,720 INFO L87 Difference]: Start difference. First operand 21422 states and 63524 transitions. Second operand 3 states. [2019-12-07 12:19:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:19:59,781 INFO L93 Difference]: Finished difference Result 21347 states and 63291 transitions. [2019-12-07 12:19:59,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:19:59,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 12:19:59,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:19:59,802 INFO L225 Difference]: With dead ends: 21347 [2019-12-07 12:19:59,802 INFO L226 Difference]: Without dead ends: 21347 [2019-12-07 12:19:59,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:19:59,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21347 states. [2019-12-07 12:20:00,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21347 to 17851. [2019-12-07 12:20:00,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17851 states. [2019-12-07 12:20:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17851 states to 17851 states and 53559 transitions. [2019-12-07 12:20:00,056 INFO L78 Accepts]: Start accepts. Automaton has 17851 states and 53559 transitions. Word has length 40 [2019-12-07 12:20:00,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:00,056 INFO L462 AbstractCegarLoop]: Abstraction has 17851 states and 53559 transitions. [2019-12-07 12:20:00,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:20:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 17851 states and 53559 transitions. [2019-12-07 12:20:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 12:20:00,070 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:00,070 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] [2019-12-07 12:20:00,070 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:00,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:00,070 INFO L82 PathProgramCache]: Analyzing trace with hash 854921497, now seen corresponding path program 1 times [2019-12-07 12:20:00,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:20:00,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370356040] [2019-12-07 12:20:00,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:00,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370356040] [2019-12-07 12:20:00,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:00,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:20:00,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540229633] [2019-12-07 12:20:00,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:20:00,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:20:00,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:20:00,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:20:00,127 INFO L87 Difference]: Start difference. First operand 17851 states and 53559 transitions. Second operand 6 states. [2019-12-07 12:20:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:00,198 INFO L93 Difference]: Finished difference Result 16802 states and 51226 transitions. [2019-12-07 12:20:00,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:20:00,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 12:20:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:00,216 INFO L225 Difference]: With dead ends: 16802 [2019-12-07 12:20:00,216 INFO L226 Difference]: Without dead ends: 16672 [2019-12-07 12:20:00,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:20:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-12-07 12:20:00,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16672. [2019-12-07 12:20:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16672 states. [2019-12-07 12:20:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16672 states to 16672 states and 50949 transitions. [2019-12-07 12:20:00,438 INFO L78 Accepts]: Start accepts. Automaton has 16672 states and 50949 transitions. Word has length 41 [2019-12-07 12:20:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:00,438 INFO L462 AbstractCegarLoop]: Abstraction has 16672 states and 50949 transitions. [2019-12-07 12:20:00,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:20:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 16672 states and 50949 transitions. [2019-12-07 12:20:00,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:20:00,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:00,454 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:00,454 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:00,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:00,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1128251409, now seen corresponding path program 1 times [2019-12-07 12:20:00,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:20:00,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549411863] [2019-12-07 12:20:00,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:00,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549411863] [2019-12-07 12:20:00,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:00,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:20:00,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106502818] [2019-12-07 12:20:00,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:20:00,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:20:00,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:20:00,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:20:00,481 INFO L87 Difference]: Start difference. First operand 16672 states and 50949 transitions. Second operand 3 states. [2019-12-07 12:20:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:00,555 INFO L93 Difference]: Finished difference Result 23766 states and 72975 transitions. [2019-12-07 12:20:00,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:20:00,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 12:20:00,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:00,579 INFO L225 Difference]: With dead ends: 23766 [2019-12-07 12:20:00,579 INFO L226 Difference]: Without dead ends: 23766 [2019-12-07 12:20:00,580 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 12:20:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23766 states. [2019-12-07 12:20:00,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23766 to 18908. [2019-12-07 12:20:00,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18908 states. [2019-12-07 12:20:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18908 states to 18908 states and 58542 transitions. [2019-12-07 12:20:00,871 INFO L78 Accepts]: Start accepts. Automaton has 18908 states and 58542 transitions. Word has length 66 [2019-12-07 12:20:00,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:00,871 INFO L462 AbstractCegarLoop]: Abstraction has 18908 states and 58542 transitions. [2019-12-07 12:20:00,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:20:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 18908 states and 58542 transitions. [2019-12-07 12:20:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:20:00,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:00,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:00,888 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:00,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:00,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1486247926, now seen corresponding path program 1 times [2019-12-07 12:20:00,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:20:00,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790620562] [2019-12-07 12:20:00,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:00,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790620562] [2019-12-07 12:20:00,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:00,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:20:00,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279879172] [2019-12-07 12:20:00,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:20:00,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:20:00,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:20:00,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:20:00,918 INFO L87 Difference]: Start difference. First operand 18908 states and 58542 transitions. Second operand 3 states. [2019-12-07 12:20:00,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:00,989 INFO L93 Difference]: Finished difference Result 22628 states and 67954 transitions. [2019-12-07 12:20:00,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:20:00,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 12:20:00,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:01,014 INFO L225 Difference]: With dead ends: 22628 [2019-12-07 12:20:01,014 INFO L226 Difference]: Without dead ends: 22628 [2019-12-07 12:20:01,014 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 12:20:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22628 states. [2019-12-07 12:20:01,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22628 to 17579. [2019-12-07 12:20:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17579 states. [2019-12-07 12:20:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17579 states to 17579 states and 52993 transitions. [2019-12-07 12:20:01,320 INFO L78 Accepts]: Start accepts. Automaton has 17579 states and 52993 transitions. Word has length 66 [2019-12-07 12:20:01,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:01,320 INFO L462 AbstractCegarLoop]: Abstraction has 17579 states and 52993 transitions. [2019-12-07 12:20:01,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:20:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 17579 states and 52993 transitions. [2019-12-07 12:20:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:20:01,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:01,334 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:01,334 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:01,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:01,335 INFO L82 PathProgramCache]: Analyzing trace with hash 2105019115, now seen corresponding path program 1 times [2019-12-07 12:20:01,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:20:01,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491477961] [2019-12-07 12:20:01,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:01,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491477961] [2019-12-07 12:20:01,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:01,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:20:01,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121904714] [2019-12-07 12:20:01,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:20:01,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:20:01,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:20:01,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:20:01,408 INFO L87 Difference]: Start difference. First operand 17579 states and 52993 transitions. Second operand 7 states. [2019-12-07 12:20:02,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:02,000 INFO L93 Difference]: Finished difference Result 27087 states and 80193 transitions. [2019-12-07 12:20:02,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 12:20:02,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 12:20:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:02,029 INFO L225 Difference]: With dead ends: 27087 [2019-12-07 12:20:02,029 INFO L226 Difference]: Without dead ends: 27087 [2019-12-07 12:20:02,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:20:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27087 states. [2019-12-07 12:20:02,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27087 to 17891. [2019-12-07 12:20:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17891 states. [2019-12-07 12:20:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17891 states to 17891 states and 53983 transitions. [2019-12-07 12:20:02,331 INFO L78 Accepts]: Start accepts. Automaton has 17891 states and 53983 transitions. Word has length 66 [2019-12-07 12:20:02,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:02,331 INFO L462 AbstractCegarLoop]: Abstraction has 17891 states and 53983 transitions. [2019-12-07 12:20:02,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:20:02,331 INFO L276 IsEmpty]: Start isEmpty. Operand 17891 states and 53983 transitions. [2019-12-07 12:20:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:20:02,346 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:02,346 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:02,346 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:02,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:02,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1336131631, now seen corresponding path program 2 times [2019-12-07 12:20:02,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:20:02,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701453038] [2019-12-07 12:20:02,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:02,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701453038] [2019-12-07 12:20:02,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:02,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:20:02,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167905689] [2019-12-07 12:20:02,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:20:02,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:20:02,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:20:02,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:20:02,432 INFO L87 Difference]: Start difference. First operand 17891 states and 53983 transitions. Second operand 8 states. [2019-12-07 12:20:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:03,794 INFO L93 Difference]: Finished difference Result 27297 states and 80757 transitions. [2019-12-07 12:20:03,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 12:20:03,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-07 12:20:03,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:03,826 INFO L225 Difference]: With dead ends: 27297 [2019-12-07 12:20:03,826 INFO L226 Difference]: Without dead ends: 27297 [2019-12-07 12:20:03,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2019-12-07 12:20:03,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27297 states. [2019-12-07 12:20:04,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27297 to 16929. [2019-12-07 12:20:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16929 states. [2019-12-07 12:20:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16929 states to 16929 states and 51164 transitions. [2019-12-07 12:20:04,111 INFO L78 Accepts]: Start accepts. Automaton has 16929 states and 51164 transitions. Word has length 66 [2019-12-07 12:20:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:04,112 INFO L462 AbstractCegarLoop]: Abstraction has 16929 states and 51164 transitions. [2019-12-07 12:20:04,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:20:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 16929 states and 51164 transitions. [2019-12-07 12:20:04,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:20:04,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:04,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:04,125 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:04,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:04,125 INFO L82 PathProgramCache]: Analyzing trace with hash 186807531, now seen corresponding path program 3 times [2019-12-07 12:20:04,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:20:04,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929727856] [2019-12-07 12:20:04,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:04,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929727856] [2019-12-07 12:20:04,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:04,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:20:04,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782503841] [2019-12-07 12:20:04,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:20:04,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:20:04,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:20:04,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:20:04,179 INFO L87 Difference]: Start difference. First operand 16929 states and 51164 transitions. Second operand 3 states. [2019-12-07 12:20:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:04,259 INFO L93 Difference]: Finished difference Result 19778 states and 59885 transitions. [2019-12-07 12:20:04,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:20:04,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 12:20:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:04,279 INFO L225 Difference]: With dead ends: 19778 [2019-12-07 12:20:04,279 INFO L226 Difference]: Without dead ends: 19778 [2019-12-07 12:20:04,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:20:04,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19778 states. [2019-12-07 12:20:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19778 to 15036. [2019-12-07 12:20:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15036 states. [2019-12-07 12:20:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15036 states to 15036 states and 45865 transitions. [2019-12-07 12:20:04,513 INFO L78 Accepts]: Start accepts. Automaton has 15036 states and 45865 transitions. Word has length 66 [2019-12-07 12:20:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:04,513 INFO L462 AbstractCegarLoop]: Abstraction has 15036 states and 45865 transitions. [2019-12-07 12:20:04,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:20:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 15036 states and 45865 transitions. [2019-12-07 12:20:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 12:20:04,526 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:04,526 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:04,526 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:04,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:04,527 INFO L82 PathProgramCache]: Analyzing trace with hash -869199490, now seen corresponding path program 1 times [2019-12-07 12:20:04,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:20:04,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500244215] [2019-12-07 12:20:04,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:04,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500244215] [2019-12-07 12:20:04,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:04,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 12:20:04,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962694038] [2019-12-07 12:20:04,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 12:20:04,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:20:04,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 12:20:04,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:20:04,868 INFO L87 Difference]: Start difference. First operand 15036 states and 45865 transitions. Second operand 15 states. [2019-12-07 12:20:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:13,090 INFO L93 Difference]: Finished difference Result 78851 states and 233290 transitions. [2019-12-07 12:20:13,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-07 12:20:13,090 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-07 12:20:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:13,164 INFO L225 Difference]: With dead ends: 78851 [2019-12-07 12:20:13,164 INFO L226 Difference]: Without dead ends: 59681 [2019-12-07 12:20:13,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=391, Invalid=2579, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 12:20:13,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59681 states. [2019-12-07 12:20:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59681 to 18748. [2019-12-07 12:20:13,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18748 states. [2019-12-07 12:20:13,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18748 states to 18748 states and 57047 transitions. [2019-12-07 12:20:13,693 INFO L78 Accepts]: Start accepts. Automaton has 18748 states and 57047 transitions. Word has length 67 [2019-12-07 12:20:13,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:13,693 INFO L462 AbstractCegarLoop]: Abstraction has 18748 states and 57047 transitions. [2019-12-07 12:20:13,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 12:20:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 18748 states and 57047 transitions. [2019-12-07 12:20:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 12:20:13,710 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:13,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:13,710 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:13,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:13,710 INFO L82 PathProgramCache]: Analyzing trace with hash -825405888, now seen corresponding path program 2 times [2019-12-07 12:20:13,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:20:13,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48774438] [2019-12-07 12:20:13,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:13,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48774438] [2019-12-07 12:20:13,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:13,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:20:13,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091588543] [2019-12-07 12:20:13,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:20:13,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:20:13,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:20:13,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:20:13,892 INFO L87 Difference]: Start difference. First operand 18748 states and 57047 transitions. Second operand 11 states. [2019-12-07 12:20:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:15,208 INFO L93 Difference]: Finished difference Result 55779 states and 167968 transitions. [2019-12-07 12:20:15,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 12:20:15,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 12:20:15,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:15,247 INFO L225 Difference]: With dead ends: 55779 [2019-12-07 12:20:15,248 INFO L226 Difference]: Without dead ends: 34872 [2019-12-07 12:20:15,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=310, Invalid=1330, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 12:20:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34872 states. [2019-12-07 12:20:15,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34872 to 18804. [2019-12-07 12:20:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18804 states. [2019-12-07 12:20:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18804 states to 18804 states and 56603 transitions. [2019-12-07 12:20:15,613 INFO L78 Accepts]: Start accepts. Automaton has 18804 states and 56603 transitions. Word has length 67 [2019-12-07 12:20:15,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:15,614 INFO L462 AbstractCegarLoop]: Abstraction has 18804 states and 56603 transitions. [2019-12-07 12:20:15,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:20:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand 18804 states and 56603 transitions. [2019-12-07 12:20:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 12:20:15,630 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:15,630 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:15,630 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:15,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:15,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1169490426, now seen corresponding path program 3 times [2019-12-07 12:20:15,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:20:15,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929992359] [2019-12-07 12:20:15,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:15,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929992359] [2019-12-07 12:20:15,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:15,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 12:20:15,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81135206] [2019-12-07 12:20:15,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 12:20:15,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:20:15,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 12:20:15,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:20:15,846 INFO L87 Difference]: Start difference. First operand 18804 states and 56603 transitions. Second operand 13 states. [2019-12-07 12:20:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:19,896 INFO L93 Difference]: Finished difference Result 62212 states and 179234 transitions. [2019-12-07 12:20:19,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-07 12:20:19,896 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-07 12:20:19,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:19,963 INFO L225 Difference]: With dead ends: 62212 [2019-12-07 12:20:19,963 INFO L226 Difference]: Without dead ends: 56129 [2019-12-07 12:20:19,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=604, Invalid=2702, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 12:20:20,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56129 states. [2019-12-07 12:20:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56129 to 18878. [2019-12-07 12:20:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18878 states. [2019-12-07 12:20:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18878 states to 18878 states and 56765 transitions. [2019-12-07 12:20:20,520 INFO L78 Accepts]: Start accepts. Automaton has 18878 states and 56765 transitions. Word has length 67 [2019-12-07 12:20:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:20,521 INFO L462 AbstractCegarLoop]: Abstraction has 18878 states and 56765 transitions. [2019-12-07 12:20:20,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 12:20:20,521 INFO L276 IsEmpty]: Start isEmpty. Operand 18878 states and 56765 transitions. [2019-12-07 12:20:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 12:20:20,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:20,541 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:20,541 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:20,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:20,541 INFO L82 PathProgramCache]: Analyzing trace with hash -164342018, now seen corresponding path program 4 times [2019-12-07 12:20:20,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:20:20,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047832718] [2019-12-07 12:20:20,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:20,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047832718] [2019-12-07 12:20:20,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:20,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 12:20:20,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114130152] [2019-12-07 12:20:20,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 12:20:20,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:20:20,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 12:20:20,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:20:20,756 INFO L87 Difference]: Start difference. First operand 18878 states and 56765 transitions. Second operand 14 states. [2019-12-07 12:20:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:23,538 INFO L93 Difference]: Finished difference Result 24056 states and 71053 transitions. [2019-12-07 12:20:23,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 12:20:23,539 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-07 12:20:23,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:23,578 INFO L225 Difference]: With dead ends: 24056 [2019-12-07 12:20:23,578 INFO L226 Difference]: Without dead ends: 22633 [2019-12-07 12:20:23,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2019-12-07 12:20:23,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22633 states. [2019-12-07 12:20:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22633 to 18470. [2019-12-07 12:20:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18470 states. [2019-12-07 12:20:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18470 states to 18470 states and 55638 transitions. [2019-12-07 12:20:23,862 INFO L78 Accepts]: Start accepts. Automaton has 18470 states and 55638 transitions. Word has length 67 [2019-12-07 12:20:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:23,863 INFO L462 AbstractCegarLoop]: Abstraction has 18470 states and 55638 transitions. [2019-12-07 12:20:23,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 12:20:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 18470 states and 55638 transitions. [2019-12-07 12:20:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 12:20:23,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:23,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:23,879 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:23,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:23,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1771988187, now seen corresponding path program 1 times [2019-12-07 12:20:23,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:20:23,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228549876] [2019-12-07 12:20:23,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:23,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228549876] [2019-12-07 12:20:23,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:23,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:20:23,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25166085] [2019-12-07 12:20:23,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:23,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:20:23,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:23,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:23,932 INFO L87 Difference]: Start difference. First operand 18470 states and 55638 transitions. Second operand 4 states. [2019-12-07 12:20:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:24,017 INFO L93 Difference]: Finished difference Result 18318 states and 54995 transitions. [2019-12-07 12:20:24,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:24,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 12:20:24,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:24,036 INFO L225 Difference]: With dead ends: 18318 [2019-12-07 12:20:24,036 INFO L226 Difference]: Without dead ends: 18318 [2019-12-07 12:20:24,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:20:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18318 states. [2019-12-07 12:20:24,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18318 to 17107. [2019-12-07 12:20:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17107 states. [2019-12-07 12:20:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17107 states to 17107 states and 51332 transitions. [2019-12-07 12:20:24,273 INFO L78 Accepts]: Start accepts. Automaton has 17107 states and 51332 transitions. Word has length 67 [2019-12-07 12:20:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:24,274 INFO L462 AbstractCegarLoop]: Abstraction has 17107 states and 51332 transitions. [2019-12-07 12:20:24,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 17107 states and 51332 transitions. [2019-12-07 12:20:24,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 12:20:24,287 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:24,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:24,287 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:24,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:24,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1080421452, now seen corresponding path program 5 times [2019-12-07 12:20:24,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:20:24,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162459133] [2019-12-07 12:20:24,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:20:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:20:24,365 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 12:20:24,365 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:20:24,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2396~0.base_39| 4)) (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= v_~y$read_delayed~0_7 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2396~0.base_39| 1)) (= v_~y$r_buff1_thd0~0_201 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2396~0.base_39|)) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2396~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2396~0.base_39|) |v_ULTIMATE.start_main_~#t2396~0.offset_26| 0)) |v_#memory_int_23|) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x~0_158) (= 0 v_~y$r_buff1_thd2~0_197) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2396~0.base_39|) (= |v_ULTIMATE.start_main_~#t2396~0.offset_26| 0) (= v_~y~0_189 0) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_785, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, ULTIMATE.start_main_~#t2398~0.base=|v_ULTIMATE.start_main_~#t2398~0.base_27|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_~#t2396~0.base=|v_ULTIMATE.start_main_~#t2396~0.base_39|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ULTIMATE.start_main_~#t2398~0.offset=|v_ULTIMATE.start_main_~#t2398~0.offset_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~y~0=v_~y~0_189, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_~#t2397~0.base=|v_ULTIMATE.start_main_~#t2397~0.base_37|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ULTIMATE.start_main_~#t2397~0.offset=|v_ULTIMATE.start_main_~#t2397~0.offset_25|, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ULTIMATE.start_main_~#t2396~0.offset=|v_ULTIMATE.start_main_~#t2396~0.offset_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2398~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t2396~0.base, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2398~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t2397~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2397~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2396~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:20:24,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0_~arg.base_11 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= v_P0Thread1of1ForFork0_~arg.offset_11 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11| (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_76 256))) (not (= (mod v_~y$w_buff0_used~0_124 256) 0)))) 1 0)) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 0))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_11, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:20:24,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2397~0.base_11| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2397~0.base_11|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2397~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2397~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2397~0.base_11|) |v_ULTIMATE.start_main_~#t2397~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2397~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t2397~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2397~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2397~0.base=|v_ULTIMATE.start_main_~#t2397~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2397~0.offset=|v_ULTIMATE.start_main_~#t2397~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2397~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2397~0.offset] because there is no mapped edge [2019-12-07 12:20:24,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2398~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2398~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2398~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2398~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2398~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2398~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2398~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2398~0.base_11|) |v_ULTIMATE.start_main_~#t2398~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2398~0.base=|v_ULTIMATE.start_main_~#t2398~0.base_11|, ULTIMATE.start_main_~#t2398~0.offset=|v_ULTIMATE.start_main_~#t2398~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2398~0.base, ULTIMATE.start_main_~#t2398~0.offset, #length] because there is no mapped edge [2019-12-07 12:20:24,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1930138529 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1930138529 256)))) (or (= (mod ~y$w_buff0_used~0_In1930138529 256) 0) (and .cse0 (= (mod ~y$w_buff1_used~0_In1930138529 256) 0)) (and (= 0 (mod ~y$r_buff1_thd3~0_In1930138529 256)) .cse0))) (= |P2Thread1of1ForFork2_#t~ite24_Out1930138529| |P2Thread1of1ForFork2_#t~ite23_Out1930138529|) .cse1 (= ~y$w_buff1~0_In1930138529 |P2Thread1of1ForFork2_#t~ite23_Out1930138529|)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite24_Out1930138529| ~y$w_buff1~0_In1930138529) (= |P2Thread1of1ForFork2_#t~ite23_In1930138529| |P2Thread1of1ForFork2_#t~ite23_Out1930138529|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In1930138529|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1930138529, ~y$w_buff1~0=~y$w_buff1~0_In1930138529, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1930138529, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1930138529, ~weak$$choice2~0=~weak$$choice2~0_In1930138529, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1930138529} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out1930138529|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out1930138529|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1930138529, ~y$w_buff1~0=~y$w_buff1~0_In1930138529, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1930138529, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1930138529, ~weak$$choice2~0=~weak$$choice2~0_In1930138529, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1930138529} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 12:20:24,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2135454855 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite26_Out2135454855| ~y$w_buff0_used~0_In2135454855) (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In2135454855 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd3~0_In2135454855 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In2135454855 256))) (= (mod ~y$w_buff0_used~0_In2135454855 256) 0))) (= |P2Thread1of1ForFork2_#t~ite26_Out2135454855| |P2Thread1of1ForFork2_#t~ite27_Out2135454855|)) (and (= ~y$w_buff0_used~0_In2135454855 |P2Thread1of1ForFork2_#t~ite27_Out2135454855|) (= |P2Thread1of1ForFork2_#t~ite26_In2135454855| |P2Thread1of1ForFork2_#t~ite26_Out2135454855|) (not .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2135454855, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In2135454855|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2135454855, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2135454855, ~weak$$choice2~0=~weak$$choice2~0_In2135454855, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2135454855} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out2135454855|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2135454855, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2135454855, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2135454855, ~weak$$choice2~0=~weak$$choice2~0_In2135454855, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out2135454855|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2135454855} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 12:20:24,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In284409878 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In284409878 256) 0))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In284409878 256) 0)) (= (mod ~y$w_buff0_used~0_In284409878 256) 0) (and .cse0 (= (mod ~y$r_buff1_thd3~0_In284409878 256) 0)))) (= |P2Thread1of1ForFork2_#t~ite29_Out284409878| |P2Thread1of1ForFork2_#t~ite30_Out284409878|) (= |P2Thread1of1ForFork2_#t~ite29_Out284409878| ~y$w_buff1_used~0_In284409878) .cse1) (and (= ~y$w_buff1_used~0_In284409878 |P2Thread1of1ForFork2_#t~ite30_Out284409878|) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite29_In284409878| |P2Thread1of1ForFork2_#t~ite29_Out284409878|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In284409878, ~y$w_buff0_used~0=~y$w_buff0_used~0_In284409878, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In284409878, ~weak$$choice2~0=~weak$$choice2~0_In284409878, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In284409878|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In284409878} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In284409878, ~y$w_buff0_used~0=~y$w_buff0_used~0_In284409878, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out284409878|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In284409878, ~weak$$choice2~0=~weak$$choice2~0_In284409878, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out284409878|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In284409878} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 12:20:24,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-07 12:20:24,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 12:20:24,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In410171860 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In410171860 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out410171860| ~y$w_buff1~0_In410171860) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out410171860| ~y~0_In410171860)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In410171860, ~y$w_buff1~0=~y$w_buff1~0_In410171860, ~y~0=~y~0_In410171860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In410171860} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In410171860, ~y$w_buff1~0=~y$w_buff1~0_In410171860, ~y~0=~y~0_In410171860, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out410171860|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In410171860} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 12:20:24,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-440227755 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-440227755 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-440227755|) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-440227755| ~y$w_buff0_used~0_In-440227755)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-440227755, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-440227755} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-440227755|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-440227755, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-440227755} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:20:24,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In742585289 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In742585289 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In742585289 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In742585289 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In742585289 |P0Thread1of1ForFork0_#t~ite6_Out742585289|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out742585289|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In742585289, ~y$w_buff0_used~0=~y$w_buff0_used~0_In742585289, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In742585289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In742585289} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out742585289|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In742585289, ~y$w_buff0_used~0=~y$w_buff0_used~0_In742585289, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In742585289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In742585289} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:20:24,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1403028023 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1403028023 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-1403028023| |P1Thread1of1ForFork1_#t~ite10_Out-1403028023|))) (or (and (= ~y$w_buff1~0_In-1403028023 |P1Thread1of1ForFork1_#t~ite9_Out-1403028023|) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-1403028023| ~y~0_In-1403028023)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1403028023, ~y$w_buff1~0=~y$w_buff1~0_In-1403028023, ~y~0=~y~0_In-1403028023, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1403028023} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1403028023, ~y$w_buff1~0=~y$w_buff1~0_In-1403028023, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1403028023|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1403028023|, ~y~0=~y~0_In-1403028023, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1403028023} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 12:20:24,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_10|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_10|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_5|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_9|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 12:20:24,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-37981070 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-37981070 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-37981070|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-37981070 |P2Thread1of1ForFork2_#t~ite40_Out-37981070|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-37981070, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-37981070} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-37981070, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-37981070, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-37981070|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 12:20:24,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1205251594 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1205251594 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-1205251594 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1205251594 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite41_Out-1205251594| 0)) (and (= |P2Thread1of1ForFork2_#t~ite41_Out-1205251594| ~y$w_buff1_used~0_In-1205251594) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1205251594, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1205251594, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1205251594, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1205251594} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1205251594, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1205251594, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1205251594|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1205251594, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1205251594} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 12:20:24,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In314844863 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In314844863 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out314844863| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out314844863| ~y$r_buff0_thd3~0_In314844863) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In314844863, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In314844863} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In314844863, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out314844863|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In314844863} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 12:20:24,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In1458408662 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1458408662 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1458408662 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1458408662 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite43_Out1458408662| ~y$r_buff1_thd3~0_In1458408662)) (and (= |P2Thread1of1ForFork2_#t~ite43_Out1458408662| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1458408662, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1458408662, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1458408662, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1458408662} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1458408662, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1458408662, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1458408662, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1458408662|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1458408662} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 12:20:24,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2089010936 256))) (.cse2 (= ~y$r_buff0_thd1~0_In2089010936 ~y$r_buff0_thd1~0_Out2089010936)) (.cse1 (= (mod ~y$w_buff0_used~0_In2089010936 256) 0))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out2089010936) (not .cse1)) (and .cse0 .cse2) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2089010936, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2089010936} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2089010936, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2089010936|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out2089010936} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:20:24,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2067488943 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2067488943 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In2067488943 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In2067488943 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out2067488943| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out2067488943| ~y$r_buff1_thd1~0_In2067488943) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2067488943, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2067488943, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2067488943, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2067488943} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2067488943, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2067488943, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2067488943|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2067488943, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2067488943} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:20:24,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 12:20:24,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite43_32| v_~y$r_buff1_thd3~0_152)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 12:20:24,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1158674108 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1158674108 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1158674108 |P1Thread1of1ForFork1_#t~ite11_Out1158674108|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1158674108|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1158674108, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1158674108} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1158674108, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1158674108, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1158674108|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 12:20:24,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In2110398686 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In2110398686 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In2110398686 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In2110398686 256)))) (or (and (= ~y$w_buff1_used~0_In2110398686 |P1Thread1of1ForFork1_#t~ite12_Out2110398686|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out2110398686|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2110398686, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2110398686, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2110398686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2110398686} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2110398686, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2110398686, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2110398686, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out2110398686|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2110398686} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 12:20:24,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1126008551 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1126008551 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1126008551| ~y$r_buff0_thd2~0_In-1126008551) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1126008551| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126008551, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1126008551} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126008551, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1126008551, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1126008551|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 12:20:24,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1165828533 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1165828533 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1165828533 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1165828533 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1165828533 |P1Thread1of1ForFork1_#t~ite14_Out-1165828533|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1165828533|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1165828533, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1165828533, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1165828533, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1165828533} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1165828533, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1165828533, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1165828533, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1165828533|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1165828533} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 12:20:24,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 12:20:24,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:20:24,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-537284542 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-537284542 256)))) (or (and (= ~y~0_In-537284542 |ULTIMATE.start_main_#t~ite47_Out-537284542|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-537284542| ~y$w_buff1~0_In-537284542) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-537284542, ~y~0=~y~0_In-537284542, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-537284542, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-537284542} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-537284542, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-537284542|, ~y~0=~y~0_In-537284542, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-537284542, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-537284542} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 12:20:24,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-07 12:20:24,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1075131156 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1075131156 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-1075131156| ~y$w_buff0_used~0_In-1075131156) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1075131156| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1075131156, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1075131156} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1075131156, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1075131156, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1075131156|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 12:20:24,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In1979454364 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1979454364 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1979454364 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1979454364 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1979454364|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1979454364 |ULTIMATE.start_main_#t~ite50_Out1979454364|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1979454364, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1979454364, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1979454364, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1979454364} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1979454364|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1979454364, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1979454364, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1979454364, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1979454364} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 12:20:24,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2027744183 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2027744183 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-2027744183|)) (and (= ~y$r_buff0_thd0~0_In-2027744183 |ULTIMATE.start_main_#t~ite51_Out-2027744183|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2027744183, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2027744183} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-2027744183|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2027744183, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2027744183} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 12:20:24,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1984249123 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1984249123 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1984249123 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1984249123 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1984249123|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In-1984249123 |ULTIMATE.start_main_#t~ite52_Out-1984249123|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1984249123, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1984249123, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1984249123, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1984249123} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1984249123|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1984249123, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1984249123, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1984249123, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1984249123} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 12:20:24,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 2 v_~x~0_130) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:20:24,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:20:24 BasicIcfg [2019-12-07 12:20:24,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:20:24,436 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:20:24,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:20:24,436 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:20:24,436 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:19:18" (3/4) ... [2019-12-07 12:20:24,438 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:20:24,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2396~0.base_39| 4)) (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= v_~y$read_delayed~0_7 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2396~0.base_39| 1)) (= v_~y$r_buff1_thd0~0_201 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2396~0.base_39|)) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2396~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2396~0.base_39|) |v_ULTIMATE.start_main_~#t2396~0.offset_26| 0)) |v_#memory_int_23|) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x~0_158) (= 0 v_~y$r_buff1_thd2~0_197) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2396~0.base_39|) (= |v_ULTIMATE.start_main_~#t2396~0.offset_26| 0) (= v_~y~0_189 0) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_785, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, ULTIMATE.start_main_~#t2398~0.base=|v_ULTIMATE.start_main_~#t2398~0.base_27|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_~#t2396~0.base=|v_ULTIMATE.start_main_~#t2396~0.base_39|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ULTIMATE.start_main_~#t2398~0.offset=|v_ULTIMATE.start_main_~#t2398~0.offset_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~y~0=v_~y~0_189, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_~#t2397~0.base=|v_ULTIMATE.start_main_~#t2397~0.base_37|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ULTIMATE.start_main_~#t2397~0.offset=|v_ULTIMATE.start_main_~#t2397~0.offset_25|, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ULTIMATE.start_main_~#t2396~0.offset=|v_ULTIMATE.start_main_~#t2396~0.offset_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2398~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t2396~0.base, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2398~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t2397~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2397~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2396~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:20:24,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0_~arg.base_11 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= v_P0Thread1of1ForFork0_~arg.offset_11 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11| (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_76 256))) (not (= (mod v_~y$w_buff0_used~0_124 256) 0)))) 1 0)) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 0))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_11, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:20:24,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2397~0.base_11| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2397~0.base_11|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2397~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2397~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2397~0.base_11|) |v_ULTIMATE.start_main_~#t2397~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2397~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t2397~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2397~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2397~0.base=|v_ULTIMATE.start_main_~#t2397~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2397~0.offset=|v_ULTIMATE.start_main_~#t2397~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2397~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2397~0.offset] because there is no mapped edge [2019-12-07 12:20:24,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2398~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2398~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2398~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2398~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2398~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2398~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2398~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2398~0.base_11|) |v_ULTIMATE.start_main_~#t2398~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2398~0.base=|v_ULTIMATE.start_main_~#t2398~0.base_11|, ULTIMATE.start_main_~#t2398~0.offset=|v_ULTIMATE.start_main_~#t2398~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2398~0.base, ULTIMATE.start_main_~#t2398~0.offset, #length] because there is no mapped edge [2019-12-07 12:20:24,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1930138529 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1930138529 256)))) (or (= (mod ~y$w_buff0_used~0_In1930138529 256) 0) (and .cse0 (= (mod ~y$w_buff1_used~0_In1930138529 256) 0)) (and (= 0 (mod ~y$r_buff1_thd3~0_In1930138529 256)) .cse0))) (= |P2Thread1of1ForFork2_#t~ite24_Out1930138529| |P2Thread1of1ForFork2_#t~ite23_Out1930138529|) .cse1 (= ~y$w_buff1~0_In1930138529 |P2Thread1of1ForFork2_#t~ite23_Out1930138529|)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite24_Out1930138529| ~y$w_buff1~0_In1930138529) (= |P2Thread1of1ForFork2_#t~ite23_In1930138529| |P2Thread1of1ForFork2_#t~ite23_Out1930138529|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In1930138529|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1930138529, ~y$w_buff1~0=~y$w_buff1~0_In1930138529, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1930138529, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1930138529, ~weak$$choice2~0=~weak$$choice2~0_In1930138529, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1930138529} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out1930138529|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out1930138529|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1930138529, ~y$w_buff1~0=~y$w_buff1~0_In1930138529, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1930138529, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1930138529, ~weak$$choice2~0=~weak$$choice2~0_In1930138529, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1930138529} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 12:20:24,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2135454855 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite26_Out2135454855| ~y$w_buff0_used~0_In2135454855) (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In2135454855 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd3~0_In2135454855 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In2135454855 256))) (= (mod ~y$w_buff0_used~0_In2135454855 256) 0))) (= |P2Thread1of1ForFork2_#t~ite26_Out2135454855| |P2Thread1of1ForFork2_#t~ite27_Out2135454855|)) (and (= ~y$w_buff0_used~0_In2135454855 |P2Thread1of1ForFork2_#t~ite27_Out2135454855|) (= |P2Thread1of1ForFork2_#t~ite26_In2135454855| |P2Thread1of1ForFork2_#t~ite26_Out2135454855|) (not .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2135454855, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In2135454855|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2135454855, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2135454855, ~weak$$choice2~0=~weak$$choice2~0_In2135454855, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2135454855} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out2135454855|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2135454855, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2135454855, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2135454855, ~weak$$choice2~0=~weak$$choice2~0_In2135454855, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out2135454855|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2135454855} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 12:20:24,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In284409878 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In284409878 256) 0))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In284409878 256) 0)) (= (mod ~y$w_buff0_used~0_In284409878 256) 0) (and .cse0 (= (mod ~y$r_buff1_thd3~0_In284409878 256) 0)))) (= |P2Thread1of1ForFork2_#t~ite29_Out284409878| |P2Thread1of1ForFork2_#t~ite30_Out284409878|) (= |P2Thread1of1ForFork2_#t~ite29_Out284409878| ~y$w_buff1_used~0_In284409878) .cse1) (and (= ~y$w_buff1_used~0_In284409878 |P2Thread1of1ForFork2_#t~ite30_Out284409878|) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite29_In284409878| |P2Thread1of1ForFork2_#t~ite29_Out284409878|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In284409878, ~y$w_buff0_used~0=~y$w_buff0_used~0_In284409878, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In284409878, ~weak$$choice2~0=~weak$$choice2~0_In284409878, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In284409878|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In284409878} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In284409878, ~y$w_buff0_used~0=~y$w_buff0_used~0_In284409878, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out284409878|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In284409878, ~weak$$choice2~0=~weak$$choice2~0_In284409878, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out284409878|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In284409878} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 12:20:24,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-07 12:20:24,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 12:20:24,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In410171860 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In410171860 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out410171860| ~y$w_buff1~0_In410171860) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out410171860| ~y~0_In410171860)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In410171860, ~y$w_buff1~0=~y$w_buff1~0_In410171860, ~y~0=~y~0_In410171860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In410171860} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In410171860, ~y$w_buff1~0=~y$w_buff1~0_In410171860, ~y~0=~y~0_In410171860, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out410171860|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In410171860} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 12:20:24,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-440227755 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-440227755 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-440227755|) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-440227755| ~y$w_buff0_used~0_In-440227755)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-440227755, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-440227755} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-440227755|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-440227755, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-440227755} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:20:24,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In742585289 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In742585289 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In742585289 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In742585289 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In742585289 |P0Thread1of1ForFork0_#t~ite6_Out742585289|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out742585289|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In742585289, ~y$w_buff0_used~0=~y$w_buff0_used~0_In742585289, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In742585289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In742585289} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out742585289|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In742585289, ~y$w_buff0_used~0=~y$w_buff0_used~0_In742585289, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In742585289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In742585289} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:20:24,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1403028023 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1403028023 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-1403028023| |P1Thread1of1ForFork1_#t~ite10_Out-1403028023|))) (or (and (= ~y$w_buff1~0_In-1403028023 |P1Thread1of1ForFork1_#t~ite9_Out-1403028023|) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-1403028023| ~y~0_In-1403028023)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1403028023, ~y$w_buff1~0=~y$w_buff1~0_In-1403028023, ~y~0=~y~0_In-1403028023, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1403028023} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1403028023, ~y$w_buff1~0=~y$w_buff1~0_In-1403028023, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1403028023|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1403028023|, ~y~0=~y~0_In-1403028023, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1403028023} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 12:20:24,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_10|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_10|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_5|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_9|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 12:20:24,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-37981070 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-37981070 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-37981070|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-37981070 |P2Thread1of1ForFork2_#t~ite40_Out-37981070|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-37981070, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-37981070} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-37981070, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-37981070, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-37981070|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 12:20:24,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1205251594 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1205251594 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-1205251594 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1205251594 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite41_Out-1205251594| 0)) (and (= |P2Thread1of1ForFork2_#t~ite41_Out-1205251594| ~y$w_buff1_used~0_In-1205251594) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1205251594, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1205251594, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1205251594, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1205251594} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1205251594, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1205251594, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1205251594|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1205251594, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1205251594} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 12:20:24,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In314844863 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In314844863 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out314844863| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out314844863| ~y$r_buff0_thd3~0_In314844863) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In314844863, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In314844863} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In314844863, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out314844863|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In314844863} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 12:20:24,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In1458408662 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1458408662 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1458408662 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1458408662 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite43_Out1458408662| ~y$r_buff1_thd3~0_In1458408662)) (and (= |P2Thread1of1ForFork2_#t~ite43_Out1458408662| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1458408662, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1458408662, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1458408662, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1458408662} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1458408662, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1458408662, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1458408662, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1458408662|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1458408662} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 12:20:24,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2089010936 256))) (.cse2 (= ~y$r_buff0_thd1~0_In2089010936 ~y$r_buff0_thd1~0_Out2089010936)) (.cse1 (= (mod ~y$w_buff0_used~0_In2089010936 256) 0))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out2089010936) (not .cse1)) (and .cse0 .cse2) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2089010936, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2089010936} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2089010936, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2089010936|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out2089010936} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:20:24,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2067488943 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2067488943 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In2067488943 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In2067488943 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out2067488943| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out2067488943| ~y$r_buff1_thd1~0_In2067488943) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2067488943, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2067488943, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2067488943, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2067488943} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2067488943, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2067488943, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2067488943|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2067488943, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2067488943} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:20:24,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 12:20:24,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite43_32| v_~y$r_buff1_thd3~0_152)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 12:20:24,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1158674108 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1158674108 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1158674108 |P1Thread1of1ForFork1_#t~ite11_Out1158674108|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1158674108|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1158674108, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1158674108} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1158674108, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1158674108, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1158674108|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 12:20:24,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In2110398686 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In2110398686 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In2110398686 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In2110398686 256)))) (or (and (= ~y$w_buff1_used~0_In2110398686 |P1Thread1of1ForFork1_#t~ite12_Out2110398686|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out2110398686|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2110398686, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2110398686, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2110398686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2110398686} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2110398686, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2110398686, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2110398686, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out2110398686|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2110398686} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 12:20:24,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1126008551 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1126008551 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1126008551| ~y$r_buff0_thd2~0_In-1126008551) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1126008551| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126008551, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1126008551} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126008551, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1126008551, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1126008551|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 12:20:24,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1165828533 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1165828533 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1165828533 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1165828533 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1165828533 |P1Thread1of1ForFork1_#t~ite14_Out-1165828533|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1165828533|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1165828533, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1165828533, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1165828533, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1165828533} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1165828533, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1165828533, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1165828533, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1165828533|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1165828533} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 12:20:24,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 12:20:24,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:20:24,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-537284542 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-537284542 256)))) (or (and (= ~y~0_In-537284542 |ULTIMATE.start_main_#t~ite47_Out-537284542|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-537284542| ~y$w_buff1~0_In-537284542) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-537284542, ~y~0=~y~0_In-537284542, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-537284542, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-537284542} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-537284542, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-537284542|, ~y~0=~y~0_In-537284542, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-537284542, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-537284542} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 12:20:24,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-07 12:20:24,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1075131156 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1075131156 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-1075131156| ~y$w_buff0_used~0_In-1075131156) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1075131156| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1075131156, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1075131156} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1075131156, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1075131156, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1075131156|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 12:20:24,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In1979454364 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1979454364 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1979454364 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1979454364 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1979454364|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1979454364 |ULTIMATE.start_main_#t~ite50_Out1979454364|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1979454364, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1979454364, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1979454364, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1979454364} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1979454364|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1979454364, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1979454364, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1979454364, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1979454364} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 12:20:24,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2027744183 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2027744183 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-2027744183|)) (and (= ~y$r_buff0_thd0~0_In-2027744183 |ULTIMATE.start_main_#t~ite51_Out-2027744183|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2027744183, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2027744183} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-2027744183|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2027744183, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2027744183} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 12:20:24,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1984249123 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1984249123 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1984249123 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1984249123 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1984249123|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In-1984249123 |ULTIMATE.start_main_#t~ite52_Out-1984249123|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1984249123, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1984249123, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1984249123, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1984249123} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1984249123|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1984249123, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1984249123, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1984249123, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1984249123} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 12:20:24,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 2 v_~x~0_130) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:20:24,518 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5c9e5656-3a6a-4d3a-ab31-f0508c55a1d3/bin/utaipan/witness.graphml [2019-12-07 12:20:24,519 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:20:24,520 INFO L168 Benchmark]: Toolchain (without parser) took 66913.62 ms. Allocated memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: 4.5 GB). Free memory was 940.7 MB in the beginning and 2.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2019-12-07 12:20:24,520 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:20:24,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -129.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:20:24,521 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:20:24,521 INFO L168 Benchmark]: Boogie Preprocessor took 25.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:20:24,522 INFO L168 Benchmark]: RCFGBuilder took 424.82 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: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:20:24,522 INFO L168 Benchmark]: TraceAbstraction took 65951.51 ms. Allocated memory was 1.1 GB in the beginning and 5.5 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-12-07 12:20:24,523 INFO L168 Benchmark]: Witness Printer took 83.06 ms. Allocated memory is still 5.5 GB. Free memory was 2.9 GB in the beginning and 2.8 GB in the end (delta: 68.7 MB). Peak memory consumption was 68.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:20:24,524 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 387.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -129.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 424.82 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: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 65951.51 ms. Allocated memory was 1.1 GB in the beginning and 5.5 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 83.06 ms. Allocated memory is still 5.5 GB. Free memory was 2.9 GB in the beginning and 2.8 GB in the end (delta: 68.7 MB). Peak memory consumption was 68.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 252 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 241 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 78269 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L815] FCALL, FORK 0 pthread_create(&t2396, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L732] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L733] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L734] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L735] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L736] 1 y$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L817] FCALL, FORK 0 pthread_create(&t2397, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L819] FCALL, FORK 0 pthread_create(&t2398, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L773] 3 __unbuffered_p2_EAX = x [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 y$flush_delayed = weak$$choice2 [L779] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L792] 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 [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L742] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=0] [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 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 [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L759] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 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 [L828] 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 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 65.7s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 26.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5656 SDtfs, 7051 SDslu, 20660 SDs, 0 SdLazy, 19240 SolverSat, 420 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 42 SyntacticMatches, 19 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148639occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 191529 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1041 NumberOfCodeBlocks, 1041 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 952 ConstructedInterpolants, 0 QuantifiedInterpolants, 293395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...