./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_rmo.oepc.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_8a0bfcdb-4f90-4517-beee-a14f1f819ff1/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8a0bfcdb-4f90-4517-beee-a14f1f819ff1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8a0bfcdb-4f90-4517-beee-a14f1f819ff1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8a0bfcdb-4f90-4517-beee-a14f1f819ff1/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8a0bfcdb-4f90-4517-beee-a14f1f819ff1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8a0bfcdb-4f90-4517-beee-a14f1f819ff1/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 7c2c913e175195bf706fadb68174e6f93da37994 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:51:24,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:51:24,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:51:24,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:51:24,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:51:24,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:51:24,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:51:24,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:51:24,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:51:24,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:51:24,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:51:24,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:51:24,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:51:24,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:51:24,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:51:24,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:51:24,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:51:24,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:51:24,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:51:24,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:51:24,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:51:24,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:51:24,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:51:24,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:51:24,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:51:24,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:51:24,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:51:24,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:51:24,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:51:24,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:51:24,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:51:24,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:51:24,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:51:24,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:51:24,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:51:24,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:51:24,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:51:24,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:51:24,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:51:24,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:51:24,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:51:24,943 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8a0bfcdb-4f90-4517-beee-a14f1f819ff1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:51:24,953 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:51:24,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:51:24,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:51:24,954 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:51:24,954 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:51:24,954 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:51:24,955 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:51:24,955 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:51:24,955 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:51:24,955 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:51:24,955 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:51:24,955 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:51:24,955 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:51:24,955 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:51:24,956 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:51:24,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:51:24,956 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:51:24,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:51:24,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:51:24,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:51:24,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:51:24,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:51:24,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:51:24,957 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:51:24,957 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:51:24,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:51:24,957 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:51:24,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:51:24,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:51:24,958 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:51:24,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:51:24,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:51:24,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:51:24,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:51:24,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:51:24,958 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:51:24,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:51:24,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:51:24,959 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:51:24,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:51:24,959 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_8a0bfcdb-4f90-4517-beee-a14f1f819ff1/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 -> 7c2c913e175195bf706fadb68174e6f93da37994 [2019-12-07 16:51:25,058 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:51:25,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:51:25,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:51:25,072 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:51:25,072 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:51:25,072 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8a0bfcdb-4f90-4517-beee-a14f1f819ff1/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi008_rmo.oepc.i [2019-12-07 16:51:25,116 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8a0bfcdb-4f90-4517-beee-a14f1f819ff1/bin/utaipan/data/778328267/42d6543135e24d07ab3f8bbc1cca0b02/FLAG08aefc883 [2019-12-07 16:51:25,572 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:51:25,573 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8a0bfcdb-4f90-4517-beee-a14f1f819ff1/sv-benchmarks/c/pthread-wmm/rfi008_rmo.oepc.i [2019-12-07 16:51:25,585 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8a0bfcdb-4f90-4517-beee-a14f1f819ff1/bin/utaipan/data/778328267/42d6543135e24d07ab3f8bbc1cca0b02/FLAG08aefc883 [2019-12-07 16:51:25,596 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8a0bfcdb-4f90-4517-beee-a14f1f819ff1/bin/utaipan/data/778328267/42d6543135e24d07ab3f8bbc1cca0b02 [2019-12-07 16:51:25,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:51:25,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:51:25,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:51:25,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:51:25,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:51:25,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:51:25" (1/1) ... [2019-12-07 16:51:25,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:25, skipping insertion in model container [2019-12-07 16:51:25,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:51:25" (1/1) ... [2019-12-07 16:51:25,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:51:25,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:51:25,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:51:25,922 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:51:25,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:51:26,026 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:51:26,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:26 WrapperNode [2019-12-07 16:51:26,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:51:26,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:51:26,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:51:26,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:51:26,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:26" (1/1) ... [2019-12-07 16:51:26,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:26" (1/1) ... [2019-12-07 16:51:26,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:51:26,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:51:26,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:51:26,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:51:26,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:26" (1/1) ... [2019-12-07 16:51:26,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:26" (1/1) ... [2019-12-07 16:51:26,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:26" (1/1) ... [2019-12-07 16:51:26,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:26" (1/1) ... [2019-12-07 16:51:26,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:26" (1/1) ... [2019-12-07 16:51:26,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:26" (1/1) ... [2019-12-07 16:51:26,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:26" (1/1) ... [2019-12-07 16:51:26,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:51:26,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:51:26,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:51:26,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:51:26,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a0bfcdb-4f90-4517-beee-a14f1f819ff1/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:51:26,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:51:26,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:51:26,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:51:26,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:51:26,147 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:51:26,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:51:26,147 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:51:26,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:51:26,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:51:26,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:51:26,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:51:26,148 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 16:51:26,552 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:51:26,552 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:51:26,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:51:26 BoogieIcfgContainer [2019-12-07 16:51:26,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:51:26,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:51:26,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:51:26,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:51:26,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:51:25" (1/3) ... [2019-12-07 16:51:26,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6730a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:51:26, skipping insertion in model container [2019-12-07 16:51:26,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:26" (2/3) ... [2019-12-07 16:51:26,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6730a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:51:26, skipping insertion in model container [2019-12-07 16:51:26,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:51:26" (3/3) ... [2019-12-07 16:51:26,557 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_rmo.oepc.i [2019-12-07 16:51:26,564 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:51:26,564 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:51:26,569 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:51:26,569 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:51:26,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,597 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,597 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,597 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,597 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,597 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:26,637 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 16:51:26,649 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:51:26,649 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:51:26,649 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:51:26,649 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:51:26,649 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:51:26,649 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:51:26,649 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:51:26,649 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:51:26,660 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-07 16:51:26,661 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-07 16:51:26,722 INFO L134 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-07 16:51:26,723 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:51:26,736 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1046 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 16:51:26,758 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-07 16:51:26,794 INFO L134 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-07 16:51:26,794 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:51:26,803 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1046 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 16:51:26,829 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-07 16:51:26,829 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:51:29,996 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 16:51:30,167 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 16:51:30,259 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146813 [2019-12-07 16:51:30,259 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 16:51:30,262 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 136 transitions [2019-12-07 16:51:31,849 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 29658 states. [2019-12-07 16:51:31,850 INFO L276 IsEmpty]: Start isEmpty. Operand 29658 states. [2019-12-07 16:51:31,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 16:51:31,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:31,855 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 16:51:31,855 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:31,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:31,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1084682, now seen corresponding path program 1 times [2019-12-07 16:51:31,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:31,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003355554] [2019-12-07 16:51:31,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:32,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003355554] [2019-12-07 16:51:32,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:32,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:51:32,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111084602] [2019-12-07 16:51:32,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:32,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:32,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:32,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:32,045 INFO L87 Difference]: Start difference. First operand 29658 states. Second operand 3 states. [2019-12-07 16:51:32,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:32,365 INFO L93 Difference]: Finished difference Result 29506 states and 103746 transitions. [2019-12-07 16:51:32,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:32,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 16:51:32,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:32,519 INFO L225 Difference]: With dead ends: 29506 [2019-12-07 16:51:32,519 INFO L226 Difference]: Without dead ends: 27490 [2019-12-07 16:51:32,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:32,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-07 16:51:33,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 27490. [2019-12-07 16:51:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-12-07 16:51:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 96576 transitions. [2019-12-07 16:51:33,532 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 96576 transitions. Word has length 3 [2019-12-07 16:51:33,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:33,533 INFO L462 AbstractCegarLoop]: Abstraction has 27490 states and 96576 transitions. [2019-12-07 16:51:33,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 96576 transitions. [2019-12-07 16:51:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 16:51:33,535 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:33,535 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:33,536 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:33,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash -272589760, now seen corresponding path program 1 times [2019-12-07 16:51:33,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:33,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593804864] [2019-12-07 16:51:33,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:33,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593804864] [2019-12-07 16:51:33,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:33,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:51:33,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455136461] [2019-12-07 16:51:33,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:51:33,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:33,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:51:33,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:33,599 INFO L87 Difference]: Start difference. First operand 27490 states and 96576 transitions. Second operand 4 states. [2019-12-07 16:51:33,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:33,975 INFO L93 Difference]: Finished difference Result 43940 states and 147802 transitions. [2019-12-07 16:51:33,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:51:33,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 16:51:33,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:34,086 INFO L225 Difference]: With dead ends: 43940 [2019-12-07 16:51:34,087 INFO L226 Difference]: Without dead ends: 43933 [2019-12-07 16:51:34,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43933 states. [2019-12-07 16:51:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43933 to 42445. [2019-12-07 16:51:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42445 states. [2019-12-07 16:51:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42445 states to 42445 states and 143845 transitions. [2019-12-07 16:51:35,222 INFO L78 Accepts]: Start accepts. Automaton has 42445 states and 143845 transitions. Word has length 11 [2019-12-07 16:51:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:35,223 INFO L462 AbstractCegarLoop]: Abstraction has 42445 states and 143845 transitions. [2019-12-07 16:51:35,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:51:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 42445 states and 143845 transitions. [2019-12-07 16:51:35,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:51:35,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:35,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:35,228 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:35,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:35,228 INFO L82 PathProgramCache]: Analyzing trace with hash 295368792, now seen corresponding path program 1 times [2019-12-07 16:51:35,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:35,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013497488] [2019-12-07 16:51:35,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:35,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013497488] [2019-12-07 16:51:35,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:35,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:51:35,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854050502] [2019-12-07 16:51:35,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:51:35,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:35,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:51:35,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:35,277 INFO L87 Difference]: Start difference. First operand 42445 states and 143845 transitions. Second operand 4 states. [2019-12-07 16:51:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:35,675 INFO L93 Difference]: Finished difference Result 54065 states and 181150 transitions. [2019-12-07 16:51:35,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:51:35,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 16:51:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:35,771 INFO L225 Difference]: With dead ends: 54065 [2019-12-07 16:51:35,771 INFO L226 Difference]: Without dead ends: 54065 [2019-12-07 16:51:35,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:36,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54065 states. [2019-12-07 16:51:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54065 to 48429. [2019-12-07 16:51:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48429 states. [2019-12-07 16:51:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48429 states to 48429 states and 163514 transitions. [2019-12-07 16:51:36,974 INFO L78 Accepts]: Start accepts. Automaton has 48429 states and 163514 transitions. Word has length 14 [2019-12-07 16:51:36,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:36,975 INFO L462 AbstractCegarLoop]: Abstraction has 48429 states and 163514 transitions. [2019-12-07 16:51:36,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:51:36,975 INFO L276 IsEmpty]: Start isEmpty. Operand 48429 states and 163514 transitions. [2019-12-07 16:51:36,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:51:36,978 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:36,978 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:36,978 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:36,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:36,978 INFO L82 PathProgramCache]: Analyzing trace with hash 566526596, now seen corresponding path program 1 times [2019-12-07 16:51:36,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:36,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019201118] [2019-12-07 16:51:36,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:37,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019201118] [2019-12-07 16:51:37,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:37,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:37,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354119] [2019-12-07 16:51:37,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:37,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:37,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:37,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:37,006 INFO L87 Difference]: Start difference. First operand 48429 states and 163514 transitions. Second operand 3 states. [2019-12-07 16:51:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:37,276 INFO L93 Difference]: Finished difference Result 84362 states and 273188 transitions. [2019-12-07 16:51:37,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:37,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 16:51:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:37,413 INFO L225 Difference]: With dead ends: 84362 [2019-12-07 16:51:37,413 INFO L226 Difference]: Without dead ends: 84362 [2019-12-07 16:51:37,414 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 16:51:38,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84362 states. [2019-12-07 16:51:38,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84362 to 74579. [2019-12-07 16:51:38,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74579 states. [2019-12-07 16:51:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74579 states to 74579 states and 244551 transitions. [2019-12-07 16:51:39,133 INFO L78 Accepts]: Start accepts. Automaton has 74579 states and 244551 transitions. Word has length 15 [2019-12-07 16:51:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:39,133 INFO L462 AbstractCegarLoop]: Abstraction has 74579 states and 244551 transitions. [2019-12-07 16:51:39,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:39,133 INFO L276 IsEmpty]: Start isEmpty. Operand 74579 states and 244551 transitions. [2019-12-07 16:51:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:51:39,137 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:39,137 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:39,137 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:39,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:39,138 INFO L82 PathProgramCache]: Analyzing trace with hash 965979864, now seen corresponding path program 1 times [2019-12-07 16:51:39,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:39,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680210644] [2019-12-07 16:51:39,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:39,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680210644] [2019-12-07 16:51:39,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:39,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:51:39,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552285828] [2019-12-07 16:51:39,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:39,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:39,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:39,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:39,194 INFO L87 Difference]: Start difference. First operand 74579 states and 244551 transitions. Second operand 3 states. [2019-12-07 16:51:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:39,533 INFO L93 Difference]: Finished difference Result 74600 states and 244461 transitions. [2019-12-07 16:51:39,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:39,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 16:51:39,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:39,652 INFO L225 Difference]: With dead ends: 74600 [2019-12-07 16:51:39,652 INFO L226 Difference]: Without dead ends: 74600 [2019-12-07 16:51:39,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:40,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-07 16:51:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74508. [2019-12-07 16:51:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74508 states. [2019-12-07 16:51:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74508 states to 74508 states and 244321 transitions. [2019-12-07 16:51:42,425 INFO L78 Accepts]: Start accepts. Automaton has 74508 states and 244321 transitions. Word has length 16 [2019-12-07 16:51:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:42,425 INFO L462 AbstractCegarLoop]: Abstraction has 74508 states and 244321 transitions. [2019-12-07 16:51:42,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 74508 states and 244321 transitions. [2019-12-07 16:51:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:51:42,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:42,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:42,430 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:42,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:42,430 INFO L82 PathProgramCache]: Analyzing trace with hash -119401417, now seen corresponding path program 1 times [2019-12-07 16:51:42,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:42,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856006432] [2019-12-07 16:51:42,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:42,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856006432] [2019-12-07 16:51:42,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:42,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:51:42,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096267614] [2019-12-07 16:51:42,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:42,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:42,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:42,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:42,477 INFO L87 Difference]: Start difference. First operand 74508 states and 244321 transitions. Second operand 3 states. [2019-12-07 16:51:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:42,708 INFO L93 Difference]: Finished difference Result 74508 states and 240926 transitions. [2019-12-07 16:51:42,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:42,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 16:51:42,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:42,836 INFO L225 Difference]: With dead ends: 74508 [2019-12-07 16:51:42,836 INFO L226 Difference]: Without dead ends: 74508 [2019-12-07 16:51:42,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74508 states. [2019-12-07 16:51:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74508 to 74308. [2019-12-07 16:51:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74308 states. [2019-12-07 16:51:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74308 states to 74308 states and 240334 transitions. [2019-12-07 16:51:44,367 INFO L78 Accepts]: Start accepts. Automaton has 74308 states and 240334 transitions. Word has length 17 [2019-12-07 16:51:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:44,367 INFO L462 AbstractCegarLoop]: Abstraction has 74308 states and 240334 transitions. [2019-12-07 16:51:44,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 74308 states and 240334 transitions. [2019-12-07 16:51:44,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:51:44,371 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:44,371 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:44,371 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:44,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:44,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1206611411, now seen corresponding path program 1 times [2019-12-07 16:51:44,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:44,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752550890] [2019-12-07 16:51:44,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:44,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752550890] [2019-12-07 16:51:44,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:44,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:51:44,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900347438] [2019-12-07 16:51:44,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:44,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:44,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:44,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:44,406 INFO L87 Difference]: Start difference. First operand 74308 states and 240334 transitions. Second operand 3 states. [2019-12-07 16:51:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:44,734 INFO L93 Difference]: Finished difference Result 69911 states and 225616 transitions. [2019-12-07 16:51:44,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:44,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 16:51:44,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:44,844 INFO L225 Difference]: With dead ends: 69911 [2019-12-07 16:51:44,845 INFO L226 Difference]: Without dead ends: 69911 [2019-12-07 16:51:44,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:45,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69911 states. [2019-12-07 16:51:46,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69911 to 69911. [2019-12-07 16:51:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69911 states. [2019-12-07 16:51:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69911 states to 69911 states and 225616 transitions. [2019-12-07 16:51:46,274 INFO L78 Accepts]: Start accepts. Automaton has 69911 states and 225616 transitions. Word has length 17 [2019-12-07 16:51:46,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:46,274 INFO L462 AbstractCegarLoop]: Abstraction has 69911 states and 225616 transitions. [2019-12-07 16:51:46,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:46,274 INFO L276 IsEmpty]: Start isEmpty. Operand 69911 states and 225616 transitions. [2019-12-07 16:51:46,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:51:46,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:46,278 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:46,278 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:46,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:46,278 INFO L82 PathProgramCache]: Analyzing trace with hash -759251224, now seen corresponding path program 1 times [2019-12-07 16:51:46,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:46,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501755052] [2019-12-07 16:51:46,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:46,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501755052] [2019-12-07 16:51:46,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:46,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:51:46,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842917983] [2019-12-07 16:51:46,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:51:46,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:46,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:51:46,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:46,311 INFO L87 Difference]: Start difference. First operand 69911 states and 225616 transitions. Second operand 4 states. [2019-12-07 16:51:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:46,721 INFO L93 Difference]: Finished difference Result 85438 states and 273755 transitions. [2019-12-07 16:51:46,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:51:46,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 16:51:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:46,856 INFO L225 Difference]: With dead ends: 85438 [2019-12-07 16:51:46,856 INFO L226 Difference]: Without dead ends: 85438 [2019-12-07 16:51:46,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85438 states. [2019-12-07 16:51:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85438 to 70560. [2019-12-07 16:51:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70560 states. [2019-12-07 16:51:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70560 states to 70560 states and 227731 transitions. [2019-12-07 16:51:48,557 INFO L78 Accepts]: Start accepts. Automaton has 70560 states and 227731 transitions. Word has length 17 [2019-12-07 16:51:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:48,557 INFO L462 AbstractCegarLoop]: Abstraction has 70560 states and 227731 transitions. [2019-12-07 16:51:48,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:51:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 70560 states and 227731 transitions. [2019-12-07 16:51:48,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:51:48,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:48,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:48,565 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:48,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:48,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2046192734, now seen corresponding path program 1 times [2019-12-07 16:51:48,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:48,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622068782] [2019-12-07 16:51:48,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:48,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622068782] [2019-12-07 16:51:48,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:48,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:51:48,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411826664] [2019-12-07 16:51:48,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:48,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:48,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:48,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:48,592 INFO L87 Difference]: Start difference. First operand 70560 states and 227731 transitions. Second operand 3 states. [2019-12-07 16:51:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:48,610 INFO L93 Difference]: Finished difference Result 6495 states and 15036 transitions. [2019-12-07 16:51:48,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:48,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 16:51:48,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:48,616 INFO L225 Difference]: With dead ends: 6495 [2019-12-07 16:51:48,616 INFO L226 Difference]: Without dead ends: 6495 [2019-12-07 16:51:48,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:48,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6495 states. [2019-12-07 16:51:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6495 to 6495. [2019-12-07 16:51:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6495 states. [2019-12-07 16:51:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6495 states to 6495 states and 15036 transitions. [2019-12-07 16:51:48,677 INFO L78 Accepts]: Start accepts. Automaton has 6495 states and 15036 transitions. Word has length 20 [2019-12-07 16:51:48,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:48,677 INFO L462 AbstractCegarLoop]: Abstraction has 6495 states and 15036 transitions. [2019-12-07 16:51:48,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:48,678 INFO L276 IsEmpty]: Start isEmpty. Operand 6495 states and 15036 transitions. [2019-12-07 16:51:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:51:48,680 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:48,680 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 16:51:48,680 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:48,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:48,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1258171186, now seen corresponding path program 1 times [2019-12-07 16:51:48,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:48,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000741503] [2019-12-07 16:51:48,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:48,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000741503] [2019-12-07 16:51:48,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:48,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:48,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268147425] [2019-12-07 16:51:48,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:51:48,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:48,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:51:48,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:48,714 INFO L87 Difference]: Start difference. First operand 6495 states and 15036 transitions. Second operand 5 states. [2019-12-07 16:51:48,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:48,955 INFO L93 Difference]: Finished difference Result 8792 states and 19920 transitions. [2019-12-07 16:51:48,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:51:48,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 16:51:48,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:48,962 INFO L225 Difference]: With dead ends: 8792 [2019-12-07 16:51:48,962 INFO L226 Difference]: Without dead ends: 8792 [2019-12-07 16:51:48,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:51:48,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8792 states. [2019-12-07 16:51:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8792 to 7888. [2019-12-07 16:51:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7888 states. [2019-12-07 16:51:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7888 states to 7888 states and 18089 transitions. [2019-12-07 16:51:49,048 INFO L78 Accepts]: Start accepts. Automaton has 7888 states and 18089 transitions. Word has length 27 [2019-12-07 16:51:49,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:49,048 INFO L462 AbstractCegarLoop]: Abstraction has 7888 states and 18089 transitions. [2019-12-07 16:51:49,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:51:49,048 INFO L276 IsEmpty]: Start isEmpty. Operand 7888 states and 18089 transitions. [2019-12-07 16:51:49,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 16:51:49,052 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:49,052 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:49,052 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:49,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1366134434, now seen corresponding path program 1 times [2019-12-07 16:51:49,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:49,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627158894] [2019-12-07 16:51:49,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:49,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627158894] [2019-12-07 16:51:49,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:49,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:49,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746221841] [2019-12-07 16:51:49,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:49,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:49,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:49,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:49,074 INFO L87 Difference]: Start difference. First operand 7888 states and 18089 transitions. Second operand 3 states. [2019-12-07 16:51:49,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:49,124 INFO L93 Difference]: Finished difference Result 8877 states and 19243 transitions. [2019-12-07 16:51:49,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:49,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 16:51:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:49,131 INFO L225 Difference]: With dead ends: 8877 [2019-12-07 16:51:49,131 INFO L226 Difference]: Without dead ends: 8877 [2019-12-07 16:51:49,131 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 16:51:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8877 states. [2019-12-07 16:51:49,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8877 to 7937. [2019-12-07 16:51:49,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7937 states. [2019-12-07 16:51:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 17330 transitions. [2019-12-07 16:51:49,207 INFO L78 Accepts]: Start accepts. Automaton has 7937 states and 17330 transitions. Word has length 30 [2019-12-07 16:51:49,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:49,207 INFO L462 AbstractCegarLoop]: Abstraction has 7937 states and 17330 transitions. [2019-12-07 16:51:49,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 7937 states and 17330 transitions. [2019-12-07 16:51:49,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 16:51:49,211 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:49,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:49,212 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:49,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:49,212 INFO L82 PathProgramCache]: Analyzing trace with hash -736726388, now seen corresponding path program 1 times [2019-12-07 16:51:49,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:49,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545724388] [2019-12-07 16:51:49,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:49,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:49,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545724388] [2019-12-07 16:51:49,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:49,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:49,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393546703] [2019-12-07 16:51:49,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:51:49,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:49,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:51:49,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:49,252 INFO L87 Difference]: Start difference. First operand 7937 states and 17330 transitions. Second operand 5 states. [2019-12-07 16:51:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:49,482 INFO L93 Difference]: Finished difference Result 9260 states and 19952 transitions. [2019-12-07 16:51:49,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:51:49,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 16:51:49,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:49,489 INFO L225 Difference]: With dead ends: 9260 [2019-12-07 16:51:49,489 INFO L226 Difference]: Without dead ends: 9260 [2019-12-07 16:51:49,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:51:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9260 states. [2019-12-07 16:51:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9260 to 7281. [2019-12-07 16:51:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7281 states. [2019-12-07 16:51:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7281 states to 7281 states and 15997 transitions. [2019-12-07 16:51:49,559 INFO L78 Accepts]: Start accepts. Automaton has 7281 states and 15997 transitions. Word has length 33 [2019-12-07 16:51:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:49,559 INFO L462 AbstractCegarLoop]: Abstraction has 7281 states and 15997 transitions. [2019-12-07 16:51:49,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:51:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 7281 states and 15997 transitions. [2019-12-07 16:51:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 16:51:49,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:49,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:49,565 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:49,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:49,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1616999435, now seen corresponding path program 1 times [2019-12-07 16:51:49,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:49,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449526489] [2019-12-07 16:51:49,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:49,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:49,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449526489] [2019-12-07 16:51:49,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:49,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:51:49,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794774223] [2019-12-07 16:51:49,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:51:49,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:49,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:51:49,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:51:49,606 INFO L87 Difference]: Start difference. First operand 7281 states and 15997 transitions. Second operand 6 states. [2019-12-07 16:51:49,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:49,972 INFO L93 Difference]: Finished difference Result 9812 states and 20992 transitions. [2019-12-07 16:51:49,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:51:49,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 16:51:49,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:49,980 INFO L225 Difference]: With dead ends: 9812 [2019-12-07 16:51:49,980 INFO L226 Difference]: Without dead ends: 9811 [2019-12-07 16:51:49,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:51:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9811 states. [2019-12-07 16:51:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9811 to 9002. [2019-12-07 16:51:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9002 states. [2019-12-07 16:51:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9002 states to 9002 states and 19455 transitions. [2019-12-07 16:51:50,061 INFO L78 Accepts]: Start accepts. Automaton has 9002 states and 19455 transitions. Word has length 39 [2019-12-07 16:51:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:50,062 INFO L462 AbstractCegarLoop]: Abstraction has 9002 states and 19455 transitions. [2019-12-07 16:51:50,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:51:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 9002 states and 19455 transitions. [2019-12-07 16:51:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 16:51:50,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:50,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:50,068 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:50,068 INFO L82 PathProgramCache]: Analyzing trace with hash 27659275, now seen corresponding path program 1 times [2019-12-07 16:51:50,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:50,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625348703] [2019-12-07 16:51:50,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:50,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 16:51:50,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625348703] [2019-12-07 16:51:50,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:50,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:51:50,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104494942] [2019-12-07 16:51:50,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:51:50,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:50,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:51:50,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:50,128 INFO L87 Difference]: Start difference. First operand 9002 states and 19455 transitions. Second operand 4 states. [2019-12-07 16:51:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:50,349 INFO L93 Difference]: Finished difference Result 13411 states and 28900 transitions. [2019-12-07 16:51:50,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:51:50,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 16:51:50,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:50,365 INFO L225 Difference]: With dead ends: 13411 [2019-12-07 16:51:50,366 INFO L226 Difference]: Without dead ends: 13411 [2019-12-07 16:51:50,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:50,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13411 states. [2019-12-07 16:51:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13411 to 9651. [2019-12-07 16:51:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9651 states. [2019-12-07 16:51:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9651 states to 9651 states and 20713 transitions. [2019-12-07 16:51:50,493 INFO L78 Accepts]: Start accepts. Automaton has 9651 states and 20713 transitions. Word has length 42 [2019-12-07 16:51:50,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:50,494 INFO L462 AbstractCegarLoop]: Abstraction has 9651 states and 20713 transitions. [2019-12-07 16:51:50,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:51:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand 9651 states and 20713 transitions. [2019-12-07 16:51:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 16:51:50,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:50,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:50,501 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:50,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:50,501 INFO L82 PathProgramCache]: Analyzing trace with hash 2095012546, now seen corresponding path program 1 times [2019-12-07 16:51:50,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:50,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231678907] [2019-12-07 16:51:50,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:50,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231678907] [2019-12-07 16:51:50,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:50,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:51:50,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546750565] [2019-12-07 16:51:50,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:51:50,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:50,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:51:50,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:51:50,657 INFO L87 Difference]: Start difference. First operand 9651 states and 20713 transitions. Second operand 9 states. [2019-12-07 16:51:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:50,879 INFO L93 Difference]: Finished difference Result 9701 states and 20813 transitions. [2019-12-07 16:51:50,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:51:50,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2019-12-07 16:51:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:50,887 INFO L225 Difference]: With dead ends: 9701 [2019-12-07 16:51:50,887 INFO L226 Difference]: Without dead ends: 9701 [2019-12-07 16:51:50,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:51:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9701 states. [2019-12-07 16:51:50,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9701 to 9701. [2019-12-07 16:51:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9701 states. [2019-12-07 16:51:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9701 states to 9701 states and 20813 transitions. [2019-12-07 16:51:50,976 INFO L78 Accepts]: Start accepts. Automaton has 9701 states and 20813 transitions. Word has length 43 [2019-12-07 16:51:50,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:50,977 INFO L462 AbstractCegarLoop]: Abstraction has 9701 states and 20813 transitions. [2019-12-07 16:51:50,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:51:50,977 INFO L276 IsEmpty]: Start isEmpty. Operand 9701 states and 20813 transitions. [2019-12-07 16:51:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 16:51:50,985 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:50,985 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:50,985 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:50,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:50,985 INFO L82 PathProgramCache]: Analyzing trace with hash 520873357, now seen corresponding path program 1 times [2019-12-07 16:51:50,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:50,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017097680] [2019-12-07 16:51:50,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:51,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017097680] [2019-12-07 16:51:51,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:51,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:51,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340692623] [2019-12-07 16:51:51,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:51:51,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:51,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:51:51,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:51,030 INFO L87 Difference]: Start difference. First operand 9701 states and 20813 transitions. Second operand 4 states. [2019-12-07 16:51:51,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:51,049 INFO L93 Difference]: Finished difference Result 6750 states and 14483 transitions. [2019-12-07 16:51:51,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:51:51,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-07 16:51:51,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:51,055 INFO L225 Difference]: With dead ends: 6750 [2019-12-07 16:51:51,055 INFO L226 Difference]: Without dead ends: 6750 [2019-12-07 16:51:51,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6750 states. [2019-12-07 16:51:51,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6750 to 5571. [2019-12-07 16:51:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5571 states. [2019-12-07 16:51:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5571 states to 5571 states and 12159 transitions. [2019-12-07 16:51:51,111 INFO L78 Accepts]: Start accepts. Automaton has 5571 states and 12159 transitions. Word has length 44 [2019-12-07 16:51:51,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:51,112 INFO L462 AbstractCegarLoop]: Abstraction has 5571 states and 12159 transitions. [2019-12-07 16:51:51,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:51:51,112 INFO L276 IsEmpty]: Start isEmpty. Operand 5571 states and 12159 transitions. [2019-12-07 16:51:51,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 16:51:51,118 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:51,118 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:51,118 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:51,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:51,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2066773011, now seen corresponding path program 1 times [2019-12-07 16:51:51,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:51,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645033664] [2019-12-07 16:51:51,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:51,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645033664] [2019-12-07 16:51:51,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:51,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:51:51,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150893285] [2019-12-07 16:51:51,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:51:51,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:51,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:51:51,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:51,180 INFO L87 Difference]: Start difference. First operand 5571 states and 12159 transitions. Second operand 5 states. [2019-12-07 16:51:51,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:51,438 INFO L93 Difference]: Finished difference Result 6410 states and 13794 transitions. [2019-12-07 16:51:51,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:51:51,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-07 16:51:51,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:51,442 INFO L225 Difference]: With dead ends: 6410 [2019-12-07 16:51:51,442 INFO L226 Difference]: Without dead ends: 6410 [2019-12-07 16:51:51,443 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 16:51:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6410 states. [2019-12-07 16:51:51,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6410 to 6030. [2019-12-07 16:51:51,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6030 states. [2019-12-07 16:51:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6030 states to 6030 states and 13095 transitions. [2019-12-07 16:51:51,495 INFO L78 Accepts]: Start accepts. Automaton has 6030 states and 13095 transitions. Word has length 69 [2019-12-07 16:51:51,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:51,495 INFO L462 AbstractCegarLoop]: Abstraction has 6030 states and 13095 transitions. [2019-12-07 16:51:51,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:51:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 6030 states and 13095 transitions. [2019-12-07 16:51:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 16:51:51,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:51,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:51,502 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash -662426301, now seen corresponding path program 2 times [2019-12-07 16:51:51,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:51,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692123101] [2019-12-07 16:51:51,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:51,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692123101] [2019-12-07 16:51:51,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:51,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:51,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271354224] [2019-12-07 16:51:51,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:51:51,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:51,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:51:51,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:51,563 INFO L87 Difference]: Start difference. First operand 6030 states and 13095 transitions. Second operand 4 states. [2019-12-07 16:51:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:51,636 INFO L93 Difference]: Finished difference Result 7581 states and 16373 transitions. [2019-12-07 16:51:51,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:51:51,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-07 16:51:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:51,642 INFO L225 Difference]: With dead ends: 7581 [2019-12-07 16:51:51,642 INFO L226 Difference]: Without dead ends: 7581 [2019-12-07 16:51:51,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:51,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2019-12-07 16:51:51,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 6438. [2019-12-07 16:51:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6438 states. [2019-12-07 16:51:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6438 states to 6438 states and 14027 transitions. [2019-12-07 16:51:51,705 INFO L78 Accepts]: Start accepts. Automaton has 6438 states and 14027 transitions. Word has length 69 [2019-12-07 16:51:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:51,706 INFO L462 AbstractCegarLoop]: Abstraction has 6438 states and 14027 transitions. [2019-12-07 16:51:51,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:51:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 6438 states and 14027 transitions. [2019-12-07 16:51:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 16:51:51,712 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:51,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:51,712 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:51,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:51,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1657430360, now seen corresponding path program 1 times [2019-12-07 16:51:51,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:51,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220572576] [2019-12-07 16:51:51,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:51,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220572576] [2019-12-07 16:51:51,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:51,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:51:51,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701972613] [2019-12-07 16:51:51,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:51:51,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:51,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:51:51,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:51:51,796 INFO L87 Difference]: Start difference. First operand 6438 states and 14027 transitions. Second operand 6 states. [2019-12-07 16:51:52,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:52,100 INFO L93 Difference]: Finished difference Result 7317 states and 15839 transitions. [2019-12-07 16:51:52,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:51:52,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-07 16:51:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:52,105 INFO L225 Difference]: With dead ends: 7317 [2019-12-07 16:51:52,105 INFO L226 Difference]: Without dead ends: 7317 [2019-12-07 16:51:52,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:51:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7317 states. [2019-12-07 16:51:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7317 to 6555. [2019-12-07 16:51:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6555 states. [2019-12-07 16:51:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6555 states to 6555 states and 14222 transitions. [2019-12-07 16:51:52,166 INFO L78 Accepts]: Start accepts. Automaton has 6555 states and 14222 transitions. Word has length 70 [2019-12-07 16:51:52,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:52,167 INFO L462 AbstractCegarLoop]: Abstraction has 6555 states and 14222 transitions. [2019-12-07 16:51:52,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:51:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 6555 states and 14222 transitions. [2019-12-07 16:51:52,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 16:51:52,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:52,173 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:52,173 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:52,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:52,173 INFO L82 PathProgramCache]: Analyzing trace with hash -813271762, now seen corresponding path program 2 times [2019-12-07 16:51:52,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:52,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311218617] [2019-12-07 16:51:52,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:52,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311218617] [2019-12-07 16:51:52,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:52,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:52,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508837352] [2019-12-07 16:51:52,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:51:52,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:52,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:51:52,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:52,253 INFO L87 Difference]: Start difference. First operand 6555 states and 14222 transitions. Second operand 4 states. [2019-12-07 16:51:52,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:52,300 INFO L93 Difference]: Finished difference Result 7498 states and 16190 transitions. [2019-12-07 16:51:52,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:51:52,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-07 16:51:52,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:52,306 INFO L225 Difference]: With dead ends: 7498 [2019-12-07 16:51:52,306 INFO L226 Difference]: Without dead ends: 5190 [2019-12-07 16:51:52,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:52,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2019-12-07 16:51:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 4430. [2019-12-07 16:51:52,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4430 states. [2019-12-07 16:51:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4430 states to 4430 states and 9445 transitions. [2019-12-07 16:51:52,361 INFO L78 Accepts]: Start accepts. Automaton has 4430 states and 9445 transitions. Word has length 70 [2019-12-07 16:51:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:52,361 INFO L462 AbstractCegarLoop]: Abstraction has 4430 states and 9445 transitions. [2019-12-07 16:51:52,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:51:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 4430 states and 9445 transitions. [2019-12-07 16:51:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 16:51:52,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:52,365 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:52,366 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:52,366 INFO L82 PathProgramCache]: Analyzing trace with hash 59906402, now seen corresponding path program 3 times [2019-12-07 16:51:52,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:52,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959944788] [2019-12-07 16:51:52,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:52,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:52,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959944788] [2019-12-07 16:51:52,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:52,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:51:52,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456376764] [2019-12-07 16:51:52,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:51:52,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:52,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:51:52,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:51:52,440 INFO L87 Difference]: Start difference. First operand 4430 states and 9445 transitions. Second operand 6 states. [2019-12-07 16:51:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:52,765 INFO L93 Difference]: Finished difference Result 5718 states and 12125 transitions. [2019-12-07 16:51:52,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:51:52,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-07 16:51:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:52,769 INFO L225 Difference]: With dead ends: 5718 [2019-12-07 16:51:52,769 INFO L226 Difference]: Without dead ends: 5718 [2019-12-07 16:51:52,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:51:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5718 states. [2019-12-07 16:51:52,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5718 to 4483. [2019-12-07 16:51:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4483 states. [2019-12-07 16:51:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4483 states to 4483 states and 9562 transitions. [2019-12-07 16:51:52,810 INFO L78 Accepts]: Start accepts. Automaton has 4483 states and 9562 transitions. Word has length 70 [2019-12-07 16:51:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:52,810 INFO L462 AbstractCegarLoop]: Abstraction has 4483 states and 9562 transitions. [2019-12-07 16:51:52,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:51:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 4483 states and 9562 transitions. [2019-12-07 16:51:52,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 16:51:52,812 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:52,813 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:52,813 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:52,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:52,813 INFO L82 PathProgramCache]: Analyzing trace with hash -764484200, now seen corresponding path program 4 times [2019-12-07 16:51:52,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:52,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38549253] [2019-12-07 16:51:52,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:52,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38549253] [2019-12-07 16:51:52,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:52,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:51:52,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709141195] [2019-12-07 16:51:52,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:51:52,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:52,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:51:52,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:52,849 INFO L87 Difference]: Start difference. First operand 4483 states and 9562 transitions. Second operand 5 states. [2019-12-07 16:51:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:53,002 INFO L93 Difference]: Finished difference Result 5380 states and 11262 transitions. [2019-12-07 16:51:53,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:51:53,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-07 16:51:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:53,006 INFO L225 Difference]: With dead ends: 5380 [2019-12-07 16:51:53,006 INFO L226 Difference]: Without dead ends: 5380 [2019-12-07 16:51:53,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:51:53,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2019-12-07 16:51:53,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 4897. [2019-12-07 16:51:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4897 states. [2019-12-07 16:51:53,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4897 states to 4897 states and 10339 transitions. [2019-12-07 16:51:53,050 INFO L78 Accepts]: Start accepts. Automaton has 4897 states and 10339 transitions. Word has length 70 [2019-12-07 16:51:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:53,050 INFO L462 AbstractCegarLoop]: Abstraction has 4897 states and 10339 transitions. [2019-12-07 16:51:53,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:51:53,051 INFO L276 IsEmpty]: Start isEmpty. Operand 4897 states and 10339 transitions. [2019-12-07 16:51:53,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 16:51:53,054 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:53,054 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:53,054 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:53,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:53,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1231066792, now seen corresponding path program 5 times [2019-12-07 16:51:53,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:53,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740307010] [2019-12-07 16:51:53,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:53,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740307010] [2019-12-07 16:51:53,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:53,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:51:53,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371482438] [2019-12-07 16:51:53,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:51:53,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:53,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:51:53,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:51:53,101 INFO L87 Difference]: Start difference. First operand 4897 states and 10339 transitions. Second operand 6 states. [2019-12-07 16:51:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:53,323 INFO L93 Difference]: Finished difference Result 5427 states and 11332 transitions. [2019-12-07 16:51:53,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:51:53,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-07 16:51:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:53,327 INFO L225 Difference]: With dead ends: 5427 [2019-12-07 16:51:53,327 INFO L226 Difference]: Without dead ends: 5427 [2019-12-07 16:51:53,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:51:53,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5427 states. [2019-12-07 16:51:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5427 to 4740. [2019-12-07 16:51:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4740 states. [2019-12-07 16:51:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4740 states to 4740 states and 10042 transitions. [2019-12-07 16:51:53,375 INFO L78 Accepts]: Start accepts. Automaton has 4740 states and 10042 transitions. Word has length 70 [2019-12-07 16:51:53,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:53,375 INFO L462 AbstractCegarLoop]: Abstraction has 4740 states and 10042 transitions. [2019-12-07 16:51:53,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:51:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 4740 states and 10042 transitions. [2019-12-07 16:51:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 16:51:53,378 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:53,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:53,378 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:53,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:53,379 INFO L82 PathProgramCache]: Analyzing trace with hash -101462227, now seen corresponding path program 1 times [2019-12-07 16:51:53,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:53,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233593106] [2019-12-07 16:51:53,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:53,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233593106] [2019-12-07 16:51:53,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:53,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:51:53,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303660283] [2019-12-07 16:51:53,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:51:53,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:53,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:51:53,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:51:53,435 INFO L87 Difference]: Start difference. First operand 4740 states and 10042 transitions. Second operand 8 states. [2019-12-07 16:51:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:53,686 INFO L93 Difference]: Finished difference Result 8994 states and 18930 transitions. [2019-12-07 16:51:53,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 16:51:53,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-12-07 16:51:53,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:53,692 INFO L225 Difference]: With dead ends: 8994 [2019-12-07 16:51:53,692 INFO L226 Difference]: Without dead ends: 7775 [2019-12-07 16:51:53,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:51:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7775 states. [2019-12-07 16:51:53,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7775 to 6131. [2019-12-07 16:51:53,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6131 states. [2019-12-07 16:51:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6131 states to 6131 states and 13146 transitions. [2019-12-07 16:51:53,762 INFO L78 Accepts]: Start accepts. Automaton has 6131 states and 13146 transitions. Word has length 71 [2019-12-07 16:51:53,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:53,762 INFO L462 AbstractCegarLoop]: Abstraction has 6131 states and 13146 transitions. [2019-12-07 16:51:53,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:51:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 6131 states and 13146 transitions. [2019-12-07 16:51:53,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 16:51:53,766 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:53,766 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:53,766 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:53,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:53,766 INFO L82 PathProgramCache]: Analyzing trace with hash 477046829, now seen corresponding path program 2 times [2019-12-07 16:51:53,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:53,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705649392] [2019-12-07 16:51:53,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:51:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:51:53,842 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 16:51:53,842 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:51:53,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~main$tmp_guard0~0_19 0) (= v_~main$tmp_guard1~0_73 0) (= 0 v_~x~0_344) (= 0 v_~x$w_buff0_used~0_997) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1729~0.base_51|)) (= 0 v_~__unbuffered_p0_EAX~0_106) (= 0 v_~x$w_buff1~0_221) (= v_~y~0_54 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff0_thd0~0_190 0) (= 0 v_~x$w_buff0~0_234) (= 0 v_~x$mem_tmp~0_169) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1729~0.base_51| 4)) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1729~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1729~0.base_51|) |v_ULTIMATE.start_main_~#t1729~0.offset_32| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_599 0) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~x$r_buff1_thd0~0_225 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1729~0.base_51| 1)) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_5| 0) (= |v_ULTIMATE.start_main_~#t1729~0.offset_32| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd2~0_403) (= v_~x$r_buff1_thd1~0_379 0) (= v_~x$flush_delayed~0_191 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1729~0.base_51|) (= v_~weak$$choice2~0_254 0) (= 0 v_~__unbuffered_cnt~0_72) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$r_buff1_thd2~0_320))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1729~0.base=|v_ULTIMATE.start_main_~#t1729~0.base_51|, ~x$w_buff0~0=v_~x$w_buff0~0_234, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_599, ~x$flush_delayed~0=v_~x$flush_delayed~0_191, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_147|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_379, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_73, ~x$mem_tmp~0=v_~x$mem_tmp~0_169, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, #length=|v_#length_17|, ULTIMATE.start_main_~#t1730~0.offset=|v_ULTIMATE.start_main_~#t1730~0.offset_18|, ~y~0=v_~y~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_~#t1730~0.base=|v_ULTIMATE.start_main_~#t1730~0.base_23|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t1729~0.offset=|v_ULTIMATE.start_main_~#t1729~0.offset_32|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_225, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_403, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_997, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~x~0=v_~x~0_344, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1729~0.base, ~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1730~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1730~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1729~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 16:51:53,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1730~0.base_11| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1730~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1730~0.base_11| 1)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1730~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1730~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1730~0.base_11|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1730~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1730~0.base_11|) |v_ULTIMATE.start_main_~#t1730~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1730~0.base=|v_ULTIMATE.start_main_~#t1730~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1730~0.offset=|v_ULTIMATE.start_main_~#t1730~0.offset_10|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1730~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1730~0.offset, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 16:51:53,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~x$r_buff1_thd2~0_Out1033192189 ~x$r_buff0_thd2~0_In1033192189) (= |P0Thread1of1ForFork1_#t~nondet3_In1033192189| ~weak$$choice0~0_Out1033192189) (= ~x$flush_delayed~0_Out1033192189 ~weak$$choice2~0_Out1033192189) (= ~x$r_buff1_thd0~0_Out1033192189 ~x$r_buff0_thd0~0_In1033192189) (= ~weak$$choice2~0_Out1033192189 |P0Thread1of1ForFork1_#t~nondet4_In1033192189|) (= ~x$r_buff1_thd1~0_Out1033192189 ~x$r_buff0_thd1~0_In1033192189) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1033192189 0)) (= ~x~0_In1033192189 ~x$mem_tmp~0_Out1033192189) (= 1 ~x$r_buff0_thd1~0_Out1033192189)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1033192189, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1033192189, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1033192189, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In1033192189|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1033192189, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In1033192189|, ~x~0=~x~0_In1033192189} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1033192189, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1033192189, ~x$flush_delayed~0=~x$flush_delayed~0_Out1033192189, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1033192189, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1033192189, ~x$mem_tmp~0=~x$mem_tmp~0_Out1033192189, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1033192189, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1033192189, ~weak$$choice0~0=~weak$$choice0~0_Out1033192189, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1033192189, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out1033192189|, ~weak$$choice2~0=~weak$$choice2~0_Out1033192189, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out1033192189|, ~x~0=~x~0_In1033192189} AuxVars[] AssignedVars[~weak$$choice0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] because there is no mapped edge [2019-12-07 16:51:53,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L744-2-->L744-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-381169206 256))) (.cse0 (= |P0Thread1of1ForFork1_#t~ite5_Out-381169206| |P0Thread1of1ForFork1_#t~ite6_Out-381169206|)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-381169206 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P0Thread1of1ForFork1_#t~ite5_Out-381169206| ~x$w_buff1~0_In-381169206)) (and (not .cse1) .cse0 (= |P0Thread1of1ForFork1_#t~ite5_Out-381169206| ~x$w_buff0~0_In-381169206) (not .cse2)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-381169206, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-381169206, ~x$w_buff1~0=~x$w_buff1~0_In-381169206, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-381169206} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-381169206, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-381169206|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-381169206, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-381169206|, ~x$w_buff1~0=~x$w_buff1~0_In-381169206, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-381169206} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 16:51:53,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~x$r_buff0_thd1~0_87 v_~x$r_buff0_thd1~0_86)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_86, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 16:51:53,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In566913281 256)))) (or (and .cse0 (= |P0Thread1of1ForFork1_#t~ite25_Out566913281| ~x~0_In566913281)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite25_Out566913281| ~x$mem_tmp~0_In566913281)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In566913281, ~x$mem_tmp~0=~x$mem_tmp~0_In566913281, ~x~0=~x~0_In566913281} OutVars{P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out566913281|, ~x$flush_delayed~0=~x$flush_delayed~0_In566913281, ~x$mem_tmp~0=~x$mem_tmp~0_In566913281, ~x~0=~x~0_In566913281} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 16:51:53,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-136939027 256)))) (or (and (= ~x$mem_tmp~0_In-136939027 |P1Thread1of1ForFork0_#t~ite54_Out-136939027|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork0_#t~ite54_Out-136939027| ~x~0_In-136939027)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-136939027, ~x$mem_tmp~0=~x$mem_tmp~0_In-136939027, ~x~0=~x~0_In-136939027} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-136939027|, ~x$flush_delayed~0=~x$flush_delayed~0_In-136939027, ~x$mem_tmp~0=~x$mem_tmp~0_In-136939027, ~x~0=~x~0_In-136939027} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 16:51:53,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-1690457180 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1690457180 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1690457180 |P1Thread1of1ForFork0_#t~ite55_Out-1690457180|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite55_Out-1690457180| ~x~0_In-1690457180)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1690457180, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1690457180, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1690457180, ~x~0=~x~0_In-1690457180} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1690457180, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1690457180, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1690457180, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-1690457180|, ~x~0=~x~0_In-1690457180} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 16:51:53,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~x~0_77 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_11|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~x~0] because there is no mapped edge [2019-12-07 16:51:53,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In160070674 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In160070674 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite57_Out160070674| ~x$w_buff0_used~0_In160070674) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite57_Out160070674| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In160070674, ~x$w_buff0_used~0=~x$w_buff0_used~0_In160070674} OutVars{P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out160070674|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In160070674, ~x$w_buff0_used~0=~x$w_buff0_used~0_In160070674} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-07 16:51:53,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In712050203 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In712050203 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In712050203 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In712050203 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite58_Out712050203|)) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In712050203 |P1Thread1of1ForFork0_#t~ite58_Out712050203|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In712050203, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In712050203, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In712050203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In712050203} OutVars{P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out712050203|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In712050203, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In712050203, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In712050203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In712050203} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-07 16:51:53,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1182454857 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1182454857 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite59_Out-1182454857|) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-1182454857 |P1Thread1of1ForFork0_#t~ite59_Out-1182454857|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1182454857, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1182454857} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1182454857, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out-1182454857|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1182454857} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-07 16:51:53,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In1286166015 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1286166015 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1286166015 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In1286166015 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite60_Out1286166015| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite60_Out1286166015| ~x$r_buff1_thd2~0_In1286166015) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1286166015, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1286166015, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1286166015, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1286166015} OutVars{P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out1286166015|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1286166015, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1286166015, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1286166015, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1286166015} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-07 16:51:53,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~x$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 16:51:53,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1535788320 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1535788320 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite28_Out1535788320| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite28_Out1535788320| ~x$w_buff0_used~0_In1535788320)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1535788320, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1535788320} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1535788320, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out1535788320|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1535788320} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 16:51:53,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L761-->L761-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd1~0_In1733910699 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1733910699 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1733910699 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1733910699 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite29_Out1733910699| ~x$w_buff1_used~0_In1733910699) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite29_Out1733910699| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1733910699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1733910699, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1733910699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1733910699} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1733910699, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out1733910699|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1733910699, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1733910699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1733910699} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 16:51:53,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L762-->L763: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1951737780 256))) (.cse0 (= ~x$r_buff0_thd1~0_Out1951737780 ~x$r_buff0_thd1~0_In1951737780)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In1951737780 256)))) (or (and .cse0 .cse1) (and (= ~x$r_buff0_thd1~0_Out1951737780 0) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1951737780, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1951737780} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1951737780, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out1951737780|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1951737780} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 16:51:53,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1430492788 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1430492788 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1430492788 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1430492788 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite31_Out1430492788|)) (and (= ~x$r_buff1_thd1~0_In1430492788 |P0Thread1of1ForFork1_#t~ite31_Out1430492788|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1430492788, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1430492788, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1430492788, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1430492788} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1430492788, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1430492788, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1430492788, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out1430492788|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1430492788} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 16:51:53,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= v_~x$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_34|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_34|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_33|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 16:51:53,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:51:53,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L826-2-->L826-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite64_Out666743070| |ULTIMATE.start_main_#t~ite63_Out666743070|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In666743070 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In666743070 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out666743070| ~x~0_In666743070) (or .cse0 .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite63_Out666743070| ~x$w_buff1~0_In666743070) .cse2 (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In666743070, ~x$w_buff1_used~0=~x$w_buff1_used~0_In666743070, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In666743070, ~x~0=~x~0_In666743070} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out666743070|, ~x$w_buff1~0=~x$w_buff1~0_In666743070, ~x$w_buff1_used~0=~x$w_buff1_used~0_In666743070, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In666743070, ~x~0=~x~0_In666743070, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out666743070|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 16:51:53,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-742212680 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-742212680 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite65_Out-742212680|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-742212680 |ULTIMATE.start_main_#t~ite65_Out-742212680|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-742212680, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-742212680} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-742212680, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-742212680|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-742212680} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 16:51:53,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L828-->L828-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1881336340 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1881336340 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1881336340 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1881336340 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite66_Out-1881336340| ~x$w_buff1_used~0_In-1881336340) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite66_Out-1881336340| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1881336340, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1881336340, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1881336340, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1881336340} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1881336340, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1881336340, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-1881336340|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1881336340, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1881336340} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 16:51:53,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2081555621 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2081555621 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In2081555621 |ULTIMATE.start_main_#t~ite67_Out2081555621|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite67_Out2081555621|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2081555621, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2081555621} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2081555621, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out2081555621|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2081555621} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 16:51:53,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-457220767 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-457220767 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-457220767 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-457220767 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite68_Out-457220767| ~x$r_buff1_thd0~0_In-457220767) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite68_Out-457220767|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-457220767, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-457220767, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-457220767, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-457220767} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-457220767, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-457220767, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-457220767|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-457220767, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-457220767} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 16:51:53,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_40 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_40 (ite (= (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= 1 v_~__unbuffered_p1_EAX~0_73) (= v_~__unbuffered_p0_EBX~0_47 0) (= v_~__unbuffered_p1_EBX~0_62 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~x$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_83|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_83|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:51:53,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:51:53 BasicIcfg [2019-12-07 16:51:53,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:51:53,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:51:53,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:51:53,919 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:51:53,920 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:51:26" (3/4) ... [2019-12-07 16:51:53,921 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:51:53,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~main$tmp_guard0~0_19 0) (= v_~main$tmp_guard1~0_73 0) (= 0 v_~x~0_344) (= 0 v_~x$w_buff0_used~0_997) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1729~0.base_51|)) (= 0 v_~__unbuffered_p0_EAX~0_106) (= 0 v_~x$w_buff1~0_221) (= v_~y~0_54 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff0_thd0~0_190 0) (= 0 v_~x$w_buff0~0_234) (= 0 v_~x$mem_tmp~0_169) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1729~0.base_51| 4)) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1729~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1729~0.base_51|) |v_ULTIMATE.start_main_~#t1729~0.offset_32| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_599 0) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~x$r_buff1_thd0~0_225 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1729~0.base_51| 1)) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_5| 0) (= |v_ULTIMATE.start_main_~#t1729~0.offset_32| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd2~0_403) (= v_~x$r_buff1_thd1~0_379 0) (= v_~x$flush_delayed~0_191 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1729~0.base_51|) (= v_~weak$$choice2~0_254 0) (= 0 v_~__unbuffered_cnt~0_72) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$r_buff1_thd2~0_320))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1729~0.base=|v_ULTIMATE.start_main_~#t1729~0.base_51|, ~x$w_buff0~0=v_~x$w_buff0~0_234, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_599, ~x$flush_delayed~0=v_~x$flush_delayed~0_191, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_147|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_379, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_73, ~x$mem_tmp~0=v_~x$mem_tmp~0_169, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, #length=|v_#length_17|, ULTIMATE.start_main_~#t1730~0.offset=|v_ULTIMATE.start_main_~#t1730~0.offset_18|, ~y~0=v_~y~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_~#t1730~0.base=|v_ULTIMATE.start_main_~#t1730~0.base_23|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t1729~0.offset=|v_ULTIMATE.start_main_~#t1729~0.offset_32|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_225, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_403, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_997, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~x~0=v_~x~0_344, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1729~0.base, ~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1730~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1730~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1729~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 16:51:53,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1730~0.base_11| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1730~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1730~0.base_11| 1)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1730~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1730~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1730~0.base_11|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1730~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1730~0.base_11|) |v_ULTIMATE.start_main_~#t1730~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1730~0.base=|v_ULTIMATE.start_main_~#t1730~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1730~0.offset=|v_ULTIMATE.start_main_~#t1730~0.offset_10|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1730~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1730~0.offset, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 16:51:53,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~x$r_buff1_thd2~0_Out1033192189 ~x$r_buff0_thd2~0_In1033192189) (= |P0Thread1of1ForFork1_#t~nondet3_In1033192189| ~weak$$choice0~0_Out1033192189) (= ~x$flush_delayed~0_Out1033192189 ~weak$$choice2~0_Out1033192189) (= ~x$r_buff1_thd0~0_Out1033192189 ~x$r_buff0_thd0~0_In1033192189) (= ~weak$$choice2~0_Out1033192189 |P0Thread1of1ForFork1_#t~nondet4_In1033192189|) (= ~x$r_buff1_thd1~0_Out1033192189 ~x$r_buff0_thd1~0_In1033192189) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1033192189 0)) (= ~x~0_In1033192189 ~x$mem_tmp~0_Out1033192189) (= 1 ~x$r_buff0_thd1~0_Out1033192189)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1033192189, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1033192189, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1033192189, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In1033192189|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1033192189, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In1033192189|, ~x~0=~x~0_In1033192189} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1033192189, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1033192189, ~x$flush_delayed~0=~x$flush_delayed~0_Out1033192189, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1033192189, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1033192189, ~x$mem_tmp~0=~x$mem_tmp~0_Out1033192189, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1033192189, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1033192189, ~weak$$choice0~0=~weak$$choice0~0_Out1033192189, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1033192189, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out1033192189|, ~weak$$choice2~0=~weak$$choice2~0_Out1033192189, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out1033192189|, ~x~0=~x~0_In1033192189} AuxVars[] AssignedVars[~weak$$choice0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] because there is no mapped edge [2019-12-07 16:51:53,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L744-2-->L744-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-381169206 256))) (.cse0 (= |P0Thread1of1ForFork1_#t~ite5_Out-381169206| |P0Thread1of1ForFork1_#t~ite6_Out-381169206|)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-381169206 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P0Thread1of1ForFork1_#t~ite5_Out-381169206| ~x$w_buff1~0_In-381169206)) (and (not .cse1) .cse0 (= |P0Thread1of1ForFork1_#t~ite5_Out-381169206| ~x$w_buff0~0_In-381169206) (not .cse2)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-381169206, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-381169206, ~x$w_buff1~0=~x$w_buff1~0_In-381169206, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-381169206} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-381169206, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-381169206|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-381169206, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-381169206|, ~x$w_buff1~0=~x$w_buff1~0_In-381169206, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-381169206} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 16:51:53,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~x$r_buff0_thd1~0_87 v_~x$r_buff0_thd1~0_86)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_86, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 16:51:53,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In566913281 256)))) (or (and .cse0 (= |P0Thread1of1ForFork1_#t~ite25_Out566913281| ~x~0_In566913281)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite25_Out566913281| ~x$mem_tmp~0_In566913281)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In566913281, ~x$mem_tmp~0=~x$mem_tmp~0_In566913281, ~x~0=~x~0_In566913281} OutVars{P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out566913281|, ~x$flush_delayed~0=~x$flush_delayed~0_In566913281, ~x$mem_tmp~0=~x$mem_tmp~0_In566913281, ~x~0=~x~0_In566913281} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 16:51:53,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-136939027 256)))) (or (and (= ~x$mem_tmp~0_In-136939027 |P1Thread1of1ForFork0_#t~ite54_Out-136939027|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork0_#t~ite54_Out-136939027| ~x~0_In-136939027)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-136939027, ~x$mem_tmp~0=~x$mem_tmp~0_In-136939027, ~x~0=~x~0_In-136939027} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-136939027|, ~x$flush_delayed~0=~x$flush_delayed~0_In-136939027, ~x$mem_tmp~0=~x$mem_tmp~0_In-136939027, ~x~0=~x~0_In-136939027} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 16:51:53,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-1690457180 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1690457180 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1690457180 |P1Thread1of1ForFork0_#t~ite55_Out-1690457180|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite55_Out-1690457180| ~x~0_In-1690457180)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1690457180, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1690457180, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1690457180, ~x~0=~x~0_In-1690457180} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1690457180, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1690457180, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1690457180, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-1690457180|, ~x~0=~x~0_In-1690457180} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 16:51:53,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~x~0_77 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_11|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~x~0] because there is no mapped edge [2019-12-07 16:51:53,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In160070674 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In160070674 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite57_Out160070674| ~x$w_buff0_used~0_In160070674) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite57_Out160070674| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In160070674, ~x$w_buff0_used~0=~x$w_buff0_used~0_In160070674} OutVars{P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out160070674|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In160070674, ~x$w_buff0_used~0=~x$w_buff0_used~0_In160070674} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-07 16:51:53,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In712050203 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In712050203 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In712050203 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In712050203 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite58_Out712050203|)) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In712050203 |P1Thread1of1ForFork0_#t~ite58_Out712050203|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In712050203, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In712050203, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In712050203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In712050203} OutVars{P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out712050203|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In712050203, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In712050203, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In712050203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In712050203} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-07 16:51:53,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1182454857 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1182454857 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite59_Out-1182454857|) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-1182454857 |P1Thread1of1ForFork0_#t~ite59_Out-1182454857|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1182454857, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1182454857} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1182454857, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out-1182454857|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1182454857} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-07 16:51:53,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In1286166015 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1286166015 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1286166015 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In1286166015 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite60_Out1286166015| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite60_Out1286166015| ~x$r_buff1_thd2~0_In1286166015) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1286166015, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1286166015, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1286166015, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1286166015} OutVars{P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out1286166015|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1286166015, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1286166015, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1286166015, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1286166015} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-07 16:51:53,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~x$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 16:51:53,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1535788320 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1535788320 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite28_Out1535788320| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite28_Out1535788320| ~x$w_buff0_used~0_In1535788320)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1535788320, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1535788320} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1535788320, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out1535788320|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1535788320} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 16:51:53,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L761-->L761-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd1~0_In1733910699 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1733910699 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1733910699 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1733910699 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite29_Out1733910699| ~x$w_buff1_used~0_In1733910699) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite29_Out1733910699| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1733910699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1733910699, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1733910699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1733910699} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1733910699, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out1733910699|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1733910699, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1733910699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1733910699} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 16:51:53,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L762-->L763: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1951737780 256))) (.cse0 (= ~x$r_buff0_thd1~0_Out1951737780 ~x$r_buff0_thd1~0_In1951737780)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In1951737780 256)))) (or (and .cse0 .cse1) (and (= ~x$r_buff0_thd1~0_Out1951737780 0) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1951737780, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1951737780} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1951737780, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out1951737780|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1951737780} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 16:51:53,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1430492788 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1430492788 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1430492788 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1430492788 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite31_Out1430492788|)) (and (= ~x$r_buff1_thd1~0_In1430492788 |P0Thread1of1ForFork1_#t~ite31_Out1430492788|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1430492788, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1430492788, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1430492788, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1430492788} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1430492788, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1430492788, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1430492788, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out1430492788|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1430492788} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 16:51:53,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= v_~x$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_34|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_34|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_33|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 16:51:53,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:51:53,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L826-2-->L826-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite64_Out666743070| |ULTIMATE.start_main_#t~ite63_Out666743070|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In666743070 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In666743070 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out666743070| ~x~0_In666743070) (or .cse0 .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite63_Out666743070| ~x$w_buff1~0_In666743070) .cse2 (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In666743070, ~x$w_buff1_used~0=~x$w_buff1_used~0_In666743070, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In666743070, ~x~0=~x~0_In666743070} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out666743070|, ~x$w_buff1~0=~x$w_buff1~0_In666743070, ~x$w_buff1_used~0=~x$w_buff1_used~0_In666743070, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In666743070, ~x~0=~x~0_In666743070, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out666743070|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 16:51:53,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-742212680 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-742212680 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite65_Out-742212680|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-742212680 |ULTIMATE.start_main_#t~ite65_Out-742212680|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-742212680, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-742212680} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-742212680, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-742212680|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-742212680} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 16:51:53,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L828-->L828-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1881336340 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1881336340 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1881336340 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1881336340 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite66_Out-1881336340| ~x$w_buff1_used~0_In-1881336340) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite66_Out-1881336340| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1881336340, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1881336340, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1881336340, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1881336340} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1881336340, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1881336340, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-1881336340|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1881336340, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1881336340} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 16:51:53,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2081555621 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2081555621 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In2081555621 |ULTIMATE.start_main_#t~ite67_Out2081555621|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite67_Out2081555621|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2081555621, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2081555621} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2081555621, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out2081555621|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2081555621} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 16:51:53,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-457220767 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-457220767 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-457220767 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-457220767 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite68_Out-457220767| ~x$r_buff1_thd0~0_In-457220767) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite68_Out-457220767|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-457220767, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-457220767, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-457220767, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-457220767} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-457220767, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-457220767, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-457220767|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-457220767, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-457220767} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 16:51:53,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_40 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_40 (ite (= (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= 1 v_~__unbuffered_p1_EAX~0_73) (= v_~__unbuffered_p0_EBX~0_47 0) (= v_~__unbuffered_p1_EBX~0_62 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~x$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_83|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_83|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:51:53,992 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8a0bfcdb-4f90-4517-beee-a14f1f819ff1/bin/utaipan/witness.graphml [2019-12-07 16:51:53,992 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:51:53,993 INFO L168 Benchmark]: Toolchain (without parser) took 28394.55 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 3.0 GB). Free memory was 942.5 MB in the beginning and 1.9 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-12-07 16:51:53,994 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:51:53,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.6 MB). Free memory was 942.5 MB in the beginning and 1.0 GB in the end (delta: -98.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:53,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:51:53,994 INFO L168 Benchmark]: Boogie Preprocessor took 27.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:53,994 INFO L168 Benchmark]: RCFGBuilder took 450.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 973.9 MB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:53,995 INFO L168 Benchmark]: TraceAbstraction took 27365.37 ms. Allocated memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 973.9 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-12-07 16:51:53,995 INFO L168 Benchmark]: Witness Printer took 73.37 ms. Allocated memory is still 4.0 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:53,996 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 427.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.6 MB). Free memory was 942.5 MB in the beginning and 1.0 GB in the end (delta: -98.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 450.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 973.9 MB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27365.37 ms. Allocated memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 973.9 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 73.37 ms. Allocated memory is still 4.0 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 191 ProgramPointsBefore, 113 ProgramPointsAfterwards, 246 TransitionsBefore, 136 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 9685 VarBasedMoverChecksPositive, 320 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 419 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 146813 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1729, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1730, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 x$w_buff1 = x$w_buff0 [L730] 1 x$w_buff0 = 1 [L731] 1 x$w_buff1_used = x$w_buff0_used [L732] 1 x$w_buff0_used = (_Bool)1 [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 x$flush_delayed = weak$$choice2 [L782] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L784] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L785] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L786] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L791] 2 x = x$flush_delayed ? x$mem_tmp : x [L792] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.1s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5295 SDtfs, 4148 SDslu, 10092 SDs, 0 SdLazy, 4243 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 44 SyntacticMatches, 18 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74579occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 48742 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1018 NumberOfCodeBlocks, 1018 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 923 ConstructedInterpolants, 0 QuantifiedInterpolants, 181753 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...