./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_power.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_d84d7c35-ddf0-4e04-a4e7-fd86d8049359/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d84d7c35-ddf0-4e04-a4e7-fd86d8049359/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d84d7c35-ddf0-4e04-a4e7-fd86d8049359/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d84d7c35-ddf0-4e04-a4e7-fd86d8049359/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d84d7c35-ddf0-4e04-a4e7-fd86d8049359/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d84d7c35-ddf0-4e04-a4e7-fd86d8049359/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 ef0628b20db46bc14cfcc47365ed24e38ce755d5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 19:06:32,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:06:32,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:06:32,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:06:32,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:06:32,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:06:32,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:06:32,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:06:32,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:06:32,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:06:32,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:06:32,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:06:32,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:06:32,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:06:32,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:06:32,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:06:32,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:06:32,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:06:32,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:06:32,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:06:32,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:06:32,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:06:32,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:06:32,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:06:32,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:06:32,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:06:32,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:06:32,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:06:32,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:06:32,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:06:32,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:06:32,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:06:32,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:06:32,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:06:32,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:06:32,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:06:32,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:06:32,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:06:32,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:06:32,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:06:32,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:06:32,910 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d84d7c35-ddf0-4e04-a4e7-fd86d8049359/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:06:32,921 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:06:32,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:06:32,922 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:06:32,922 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:06:32,922 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:06:32,922 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:06:32,922 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:06:32,922 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:06:32,923 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:06:32,923 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:06:32,923 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:06:32,923 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:06:32,923 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:06:32,923 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:06:32,923 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:06:32,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:06:32,924 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:06:32,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:06:32,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:06:32,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:06:32,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:06:32,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:06:32,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:06:32,925 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:06:32,925 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:06:32,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:06:32,925 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:06:32,925 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:06:32,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:06:32,925 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:06:32,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:06:32,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:06:32,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:06:32,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:06:32,926 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:06:32,926 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:06:32,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:06:32,927 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:06:32,927 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:06:32,927 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:06:32,927 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_d84d7c35-ddf0-4e04-a4e7-fd86d8049359/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 -> ef0628b20db46bc14cfcc47365ed24e38ce755d5 [2019-12-07 19:06:33,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:06:33,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:06:33,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:06:33,056 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:06:33,057 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:06:33,057 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d84d7c35-ddf0-4e04-a4e7-fd86d8049359/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc.i [2019-12-07 19:06:33,098 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d84d7c35-ddf0-4e04-a4e7-fd86d8049359/bin/utaipan/data/572201c52/6d767a9cac674b5db5cd70974925d20d/FLAGcc4b7cdaf [2019-12-07 19:06:33,476 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:06:33,476 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d84d7c35-ddf0-4e04-a4e7-fd86d8049359/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc.i [2019-12-07 19:06:33,485 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d84d7c35-ddf0-4e04-a4e7-fd86d8049359/bin/utaipan/data/572201c52/6d767a9cac674b5db5cd70974925d20d/FLAGcc4b7cdaf [2019-12-07 19:06:33,494 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d84d7c35-ddf0-4e04-a4e7-fd86d8049359/bin/utaipan/data/572201c52/6d767a9cac674b5db5cd70974925d20d [2019-12-07 19:06:33,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:06:33,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:06:33,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:06:33,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:06:33,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:06:33,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:06:33" (1/1) ... [2019-12-07 19:06:33,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:06:33, skipping insertion in model container [2019-12-07 19:06:33,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:06:33" (1/1) ... [2019-12-07 19:06:33,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:06:33,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:06:33,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:06:33,792 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:06:33,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:06:33,876 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:06:33,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:06:33 WrapperNode [2019-12-07 19:06:33,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:06:33,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:06:33,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:06:33,877 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:06:33,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:06:33" (1/1) ... [2019-12-07 19:06:33,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:06:33" (1/1) ... [2019-12-07 19:06:33,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:06:33,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:06:33,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:06:33,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:06:33,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:06:33" (1/1) ... [2019-12-07 19:06:33,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:06:33" (1/1) ... [2019-12-07 19:06:33,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:06:33" (1/1) ... [2019-12-07 19:06:33,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:06:33" (1/1) ... [2019-12-07 19:06:33,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:06:33" (1/1) ... [2019-12-07 19:06:33,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:06:33" (1/1) ... [2019-12-07 19:06:33,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:06:33" (1/1) ... [2019-12-07 19:06:33,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:06:33,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:06:33,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:06:33,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:06:33,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:06:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d84d7c35-ddf0-4e04-a4e7-fd86d8049359/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 19:06:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:06:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:06:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:06:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:06:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:06:33,983 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:06:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:06:33,983 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:06:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:06:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:06:33,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:06:33,985 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 19:06:34,311 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:06:34,311 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:06:34,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:06:34 BoogieIcfgContainer [2019-12-07 19:06:34,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:06:34,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:06:34,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:06:34,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:06:34,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:06:33" (1/3) ... [2019-12-07 19:06:34,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c13c4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:06:34, skipping insertion in model container [2019-12-07 19:06:34,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:06:33" (2/3) ... [2019-12-07 19:06:34,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c13c4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:06:34, skipping insertion in model container [2019-12-07 19:06:34,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:06:34" (3/3) ... [2019-12-07 19:06:34,316 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc.i [2019-12-07 19:06:34,322 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:06:34,323 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:06:34,327 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:06:34,328 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:06:34,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,352 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,352 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,370 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:06:34,388 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 19:06:34,404 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:06:34,404 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:06:34,405 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:06:34,405 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:06:34,405 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:06:34,405 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:06:34,405 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:06:34,405 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:06:34,417 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-12-07 19:06:34,418 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-07 19:06:34,467 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-07 19:06:34,467 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:06:34,474 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 19:06:34,484 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-07 19:06:34,507 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-07 19:06:34,507 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:06:34,510 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 19:06:34,518 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 19:06:34,519 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:06:37,023 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 19:06:37,113 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39492 [2019-12-07 19:06:37,113 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-12-07 19:06:37,116 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 75 transitions [2019-12-07 19:06:37,328 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6150 states. [2019-12-07 19:06:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states. [2019-12-07 19:06:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 19:06:37,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:37,334 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 19:06:37,335 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:37,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:37,339 INFO L82 PathProgramCache]: Analyzing trace with hash 681495893, now seen corresponding path program 1 times [2019-12-07 19:06:37,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:37,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069699294] [2019-12-07 19:06:37,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:06:37,483 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 19:06:37,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069699294] [2019-12-07 19:06:37,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:06:37,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:06:37,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581396752] [2019-12-07 19:06:37,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:06:37,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:06:37,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:06:37,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:06:37,499 INFO L87 Difference]: Start difference. First operand 6150 states. Second operand 3 states. [2019-12-07 19:06:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:06:37,647 INFO L93 Difference]: Finished difference Result 5990 states and 20128 transitions. [2019-12-07 19:06:37,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:06:37,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 19:06:37,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:06:37,724 INFO L225 Difference]: With dead ends: 5990 [2019-12-07 19:06:37,724 INFO L226 Difference]: Without dead ends: 5642 [2019-12-07 19:06:37,725 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 19:06:37,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-12-07 19:06:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5642. [2019-12-07 19:06:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-12-07 19:06:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 18923 transitions. [2019-12-07 19:06:37,942 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 18923 transitions. Word has length 5 [2019-12-07 19:06:37,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:06:37,943 INFO L462 AbstractCegarLoop]: Abstraction has 5642 states and 18923 transitions. [2019-12-07 19:06:37,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:06:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 18923 transitions. [2019-12-07 19:06:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:06:37,945 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:37,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:06:37,946 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:37,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1994037290, now seen corresponding path program 1 times [2019-12-07 19:06:37,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:37,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878561484] [2019-12-07 19:06:37,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:06:38,001 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 19:06:38,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878561484] [2019-12-07 19:06:38,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:06:38,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:06:38,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911961941] [2019-12-07 19:06:38,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:06:38,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:06:38,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:06:38,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:06:38,003 INFO L87 Difference]: Start difference. First operand 5642 states and 18923 transitions. Second operand 4 states. [2019-12-07 19:06:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:06:38,238 INFO L93 Difference]: Finished difference Result 8500 states and 27431 transitions. [2019-12-07 19:06:38,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:06:38,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 19:06:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:06:38,300 INFO L225 Difference]: With dead ends: 8500 [2019-12-07 19:06:38,300 INFO L226 Difference]: Without dead ends: 8487 [2019-12-07 19:06:38,301 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 19:06:38,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2019-12-07 19:06:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 7476. [2019-12-07 19:06:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7476 states. [2019-12-07 19:06:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7476 states to 7476 states and 24583 transitions. [2019-12-07 19:06:38,492 INFO L78 Accepts]: Start accepts. Automaton has 7476 states and 24583 transitions. Word has length 11 [2019-12-07 19:06:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:06:38,492 INFO L462 AbstractCegarLoop]: Abstraction has 7476 states and 24583 transitions. [2019-12-07 19:06:38,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:06:38,493 INFO L276 IsEmpty]: Start isEmpty. Operand 7476 states and 24583 transitions. [2019-12-07 19:06:38,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:06:38,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:38,499 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:06:38,499 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:38,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:38,499 INFO L82 PathProgramCache]: Analyzing trace with hash 638913215, now seen corresponding path program 1 times [2019-12-07 19:06:38,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:38,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11478421] [2019-12-07 19:06:38,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:06:38,542 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 19:06:38,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11478421] [2019-12-07 19:06:38,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:06:38,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:06:38,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511821489] [2019-12-07 19:06:38,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:06:38,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:06:38,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:06:38,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:06:38,543 INFO L87 Difference]: Start difference. First operand 7476 states and 24583 transitions. Second operand 3 states. [2019-12-07 19:06:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:06:38,607 INFO L93 Difference]: Finished difference Result 10006 states and 32837 transitions. [2019-12-07 19:06:38,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:06:38,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 19:06:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:06:38,632 INFO L225 Difference]: With dead ends: 10006 [2019-12-07 19:06:38,632 INFO L226 Difference]: Without dead ends: 10006 [2019-12-07 19:06:38,632 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 19:06:38,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10006 states. [2019-12-07 19:06:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10006 to 8662. [2019-12-07 19:06:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8662 states. [2019-12-07 19:06:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8662 states to 8662 states and 28605 transitions. [2019-12-07 19:06:38,849 INFO L78 Accepts]: Start accepts. Automaton has 8662 states and 28605 transitions. Word has length 14 [2019-12-07 19:06:38,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:06:38,850 INFO L462 AbstractCegarLoop]: Abstraction has 8662 states and 28605 transitions. [2019-12-07 19:06:38,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:06:38,850 INFO L276 IsEmpty]: Start isEmpty. Operand 8662 states and 28605 transitions. [2019-12-07 19:06:38,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:06:38,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:38,852 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:06:38,852 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:38,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:38,852 INFO L82 PathProgramCache]: Analyzing trace with hash 775445368, now seen corresponding path program 1 times [2019-12-07 19:06:38,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:38,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139778053] [2019-12-07 19:06:38,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:06:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:06:38,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139778053] [2019-12-07 19:06:38,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:06:38,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:06:38,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132500842] [2019-12-07 19:06:38,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:06:38,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:06:38,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:06:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:06:38,892 INFO L87 Difference]: Start difference. First operand 8662 states and 28605 transitions. Second operand 4 states. [2019-12-07 19:06:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:06:39,016 INFO L93 Difference]: Finished difference Result 10925 states and 35253 transitions. [2019-12-07 19:06:39,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:06:39,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 19:06:39,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:06:39,037 INFO L225 Difference]: With dead ends: 10925 [2019-12-07 19:06:39,037 INFO L226 Difference]: Without dead ends: 10913 [2019-12-07 19:06:39,038 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 19:06:39,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10913 states. [2019-12-07 19:06:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10913 to 9512. [2019-12-07 19:06:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9512 states. [2019-12-07 19:06:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9512 states to 9512 states and 31144 transitions. [2019-12-07 19:06:39,226 INFO L78 Accepts]: Start accepts. Automaton has 9512 states and 31144 transitions. Word has length 14 [2019-12-07 19:06:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:06:39,226 INFO L462 AbstractCegarLoop]: Abstraction has 9512 states and 31144 transitions. [2019-12-07 19:06:39,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:06:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 9512 states and 31144 transitions. [2019-12-07 19:06:39,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:06:39,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:39,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:06:39,228 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:39,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:39,229 INFO L82 PathProgramCache]: Analyzing trace with hash -289899718, now seen corresponding path program 1 times [2019-12-07 19:06:39,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:39,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336256817] [2019-12-07 19:06:39,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:06:39,262 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 19:06:39,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336256817] [2019-12-07 19:06:39,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:06:39,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:06:39,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158932897] [2019-12-07 19:06:39,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:06:39,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:06:39,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:06:39,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:06:39,264 INFO L87 Difference]: Start difference. First operand 9512 states and 31144 transitions. Second operand 4 states. [2019-12-07 19:06:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:06:39,389 INFO L93 Difference]: Finished difference Result 11905 states and 38437 transitions. [2019-12-07 19:06:39,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:06:39,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 19:06:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:06:39,407 INFO L225 Difference]: With dead ends: 11905 [2019-12-07 19:06:39,407 INFO L226 Difference]: Without dead ends: 11891 [2019-12-07 19:06:39,407 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 19:06:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11891 states. [2019-12-07 19:06:39,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11891 to 9738. [2019-12-07 19:06:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9738 states. [2019-12-07 19:06:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9738 states to 9738 states and 31931 transitions. [2019-12-07 19:06:39,629 INFO L78 Accepts]: Start accepts. Automaton has 9738 states and 31931 transitions. Word has length 14 [2019-12-07 19:06:39,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:06:39,629 INFO L462 AbstractCegarLoop]: Abstraction has 9738 states and 31931 transitions. [2019-12-07 19:06:39,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:06:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 9738 states and 31931 transitions. [2019-12-07 19:06:39,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 19:06:39,632 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:39,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:06:39,633 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:39,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:39,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2043144141, now seen corresponding path program 1 times [2019-12-07 19:06:39,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:39,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199217785] [2019-12-07 19:06:39,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:06:39,682 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 19:06:39,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199217785] [2019-12-07 19:06:39,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:06:39,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:06:39,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616284562] [2019-12-07 19:06:39,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:06:39,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:06:39,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:06:39,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:06:39,683 INFO L87 Difference]: Start difference. First operand 9738 states and 31931 transitions. Second operand 3 states. [2019-12-07 19:06:39,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:06:39,733 INFO L93 Difference]: Finished difference Result 16550 states and 54111 transitions. [2019-12-07 19:06:39,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:06:39,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 19:06:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:06:39,755 INFO L225 Difference]: With dead ends: 16550 [2019-12-07 19:06:39,755 INFO L226 Difference]: Without dead ends: 15886 [2019-12-07 19:06:39,756 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 19:06:39,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15886 states. [2019-12-07 19:06:39,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15886 to 15319. [2019-12-07 19:06:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15319 states. [2019-12-07 19:06:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15319 states to 15319 states and 50702 transitions. [2019-12-07 19:06:40,002 INFO L78 Accepts]: Start accepts. Automaton has 15319 states and 50702 transitions. Word has length 16 [2019-12-07 19:06:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:06:40,002 INFO L462 AbstractCegarLoop]: Abstraction has 15319 states and 50702 transitions. [2019-12-07 19:06:40,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:06:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 15319 states and 50702 transitions. [2019-12-07 19:06:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:06:40,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:40,010 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 19:06:40,011 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:40,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:40,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1927848057, now seen corresponding path program 1 times [2019-12-07 19:06:40,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:40,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109418443] [2019-12-07 19:06:40,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:06:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:06:40,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109418443] [2019-12-07 19:06:40,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:06:40,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:06:40,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421160880] [2019-12-07 19:06:40,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:06:40,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:06:40,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:06:40,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:06:40,057 INFO L87 Difference]: Start difference. First operand 15319 states and 50702 transitions. Second operand 3 states. [2019-12-07 19:06:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:06:40,106 INFO L93 Difference]: Finished difference Result 14507 states and 47200 transitions. [2019-12-07 19:06:40,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:06:40,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 19:06:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:06:40,126 INFO L225 Difference]: With dead ends: 14507 [2019-12-07 19:06:40,126 INFO L226 Difference]: Without dead ends: 14507 [2019-12-07 19:06:40,127 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 19:06:40,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14507 states. [2019-12-07 19:06:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14507 to 14339. [2019-12-07 19:06:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14339 states. [2019-12-07 19:06:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14339 states to 14339 states and 46700 transitions. [2019-12-07 19:06:40,381 INFO L78 Accepts]: Start accepts. Automaton has 14339 states and 46700 transitions. Word has length 17 [2019-12-07 19:06:40,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:06:40,382 INFO L462 AbstractCegarLoop]: Abstraction has 14339 states and 46700 transitions. [2019-12-07 19:06:40,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:06:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 14339 states and 46700 transitions. [2019-12-07 19:06:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:06:40,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:40,386 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 19:06:40,386 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:40,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:40,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1236852315, now seen corresponding path program 1 times [2019-12-07 19:06:40,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:40,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725208995] [2019-12-07 19:06:40,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:06:40,452 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 19:06:40,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725208995] [2019-12-07 19:06:40,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:06:40,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:06:40,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004316334] [2019-12-07 19:06:40,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:06:40,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:06:40,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:06:40,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:06:40,454 INFO L87 Difference]: Start difference. First operand 14339 states and 46700 transitions. Second operand 4 states. [2019-12-07 19:06:40,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:06:40,503 INFO L93 Difference]: Finished difference Result 14188 states and 46235 transitions. [2019-12-07 19:06:40,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:06:40,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 19:06:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:06:40,522 INFO L225 Difference]: With dead ends: 14188 [2019-12-07 19:06:40,522 INFO L226 Difference]: Without dead ends: 14084 [2019-12-07 19:06:40,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:06:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14084 states. [2019-12-07 19:06:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14084 to 14084. [2019-12-07 19:06:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14084 states. [2019-12-07 19:06:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14084 states to 14084 states and 45897 transitions. [2019-12-07 19:06:40,725 INFO L78 Accepts]: Start accepts. Automaton has 14084 states and 45897 transitions. Word has length 17 [2019-12-07 19:06:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:06:40,725 INFO L462 AbstractCegarLoop]: Abstraction has 14084 states and 45897 transitions. [2019-12-07 19:06:40,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:06:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 14084 states and 45897 transitions. [2019-12-07 19:06:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:06:40,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:40,732 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:06:40,732 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:40,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:40,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2069901673, now seen corresponding path program 1 times [2019-12-07 19:06:40,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:40,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429998808] [2019-12-07 19:06:40,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:06:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:06:40,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429998808] [2019-12-07 19:06:40,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:06:40,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:06:40,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850672634] [2019-12-07 19:06:40,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:06:40,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:06:40,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:06:40,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:06:40,762 INFO L87 Difference]: Start difference. First operand 14084 states and 45897 transitions. Second operand 3 states. [2019-12-07 19:06:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:06:40,771 INFO L93 Difference]: Finished difference Result 1973 states and 4784 transitions. [2019-12-07 19:06:40,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:06:40,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 19:06:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:06:40,772 INFO L225 Difference]: With dead ends: 1973 [2019-12-07 19:06:40,773 INFO L226 Difference]: Without dead ends: 1973 [2019-12-07 19:06:40,773 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 19:06:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2019-12-07 19:06:40,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1973. [2019-12-07 19:06:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1973 states. [2019-12-07 19:06:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 4784 transitions. [2019-12-07 19:06:40,791 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 4784 transitions. Word has length 19 [2019-12-07 19:06:40,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:06:40,791 INFO L462 AbstractCegarLoop]: Abstraction has 1973 states and 4784 transitions. [2019-12-07 19:06:40,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:06:40,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 4784 transitions. [2019-12-07 19:06:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 19:06:40,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:40,793 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] [2019-12-07 19:06:40,793 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:40,793 INFO L82 PathProgramCache]: Analyzing trace with hash -719161205, now seen corresponding path program 1 times [2019-12-07 19:06:40,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:40,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744874816] [2019-12-07 19:06:40,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:06:40,829 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 19:06:40,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744874816] [2019-12-07 19:06:40,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:06:40,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:06:40,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588013960] [2019-12-07 19:06:40,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:06:40,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:06:40,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:06:40,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:06:40,830 INFO L87 Difference]: Start difference. First operand 1973 states and 4784 transitions. Second operand 5 states. [2019-12-07 19:06:40,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:06:40,979 INFO L93 Difference]: Finished difference Result 2552 states and 6074 transitions. [2019-12-07 19:06:40,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:06:40,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 19:06:40,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:06:40,982 INFO L225 Difference]: With dead ends: 2552 [2019-12-07 19:06:40,982 INFO L226 Difference]: Without dead ends: 2516 [2019-12-07 19:06:40,983 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 19:06:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2019-12-07 19:06:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2056. [2019-12-07 19:06:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-12-07 19:06:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 4961 transitions. [2019-12-07 19:06:41,009 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 4961 transitions. Word has length 26 [2019-12-07 19:06:41,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:06:41,009 INFO L462 AbstractCegarLoop]: Abstraction has 2056 states and 4961 transitions. [2019-12-07 19:06:41,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:06:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 4961 transitions. [2019-12-07 19:06:41,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 19:06:41,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:41,011 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 19:06:41,011 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:41,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:41,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1381829350, now seen corresponding path program 1 times [2019-12-07 19:06:41,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:41,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111295252] [2019-12-07 19:06:41,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:06:41,077 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 19:06:41,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111295252] [2019-12-07 19:06:41,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:06:41,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:06:41,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373507944] [2019-12-07 19:06:41,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:06:41,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:06:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:06:41,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:06:41,079 INFO L87 Difference]: Start difference. First operand 2056 states and 4961 transitions. Second operand 5 states. [2019-12-07 19:06:41,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:06:41,175 INFO L93 Difference]: Finished difference Result 2314 states and 5527 transitions. [2019-12-07 19:06:41,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:06:41,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 19:06:41,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:06:41,177 INFO L225 Difference]: With dead ends: 2314 [2019-12-07 19:06:41,177 INFO L226 Difference]: Without dead ends: 2314 [2019-12-07 19:06:41,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:06:41,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-12-07 19:06:41,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2115. [2019-12-07 19:06:41,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2019-12-07 19:06:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 5071 transitions. [2019-12-07 19:06:41,196 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 5071 transitions. Word has length 27 [2019-12-07 19:06:41,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:06:41,196 INFO L462 AbstractCegarLoop]: Abstraction has 2115 states and 5071 transitions. [2019-12-07 19:06:41,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:06:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 5071 transitions. [2019-12-07 19:06:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 19:06:41,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:41,198 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 19:06:41,198 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2043230427, now seen corresponding path program 1 times [2019-12-07 19:06:41,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:41,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057904576] [2019-12-07 19:06:41,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:06:41,232 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 19:06:41,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057904576] [2019-12-07 19:06:41,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:06:41,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:06:41,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694902613] [2019-12-07 19:06:41,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:06:41,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:06:41,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:06:41,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:06:41,233 INFO L87 Difference]: Start difference. First operand 2115 states and 5071 transitions. Second operand 5 states. [2019-12-07 19:06:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:06:41,344 INFO L93 Difference]: Finished difference Result 2498 states and 5944 transitions. [2019-12-07 19:06:41,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:06:41,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 19:06:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:06:41,347 INFO L225 Difference]: With dead ends: 2498 [2019-12-07 19:06:41,347 INFO L226 Difference]: Without dead ends: 2462 [2019-12-07 19:06:41,348 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 19:06:41,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2019-12-07 19:06:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2055. [2019-12-07 19:06:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2019-12-07 19:06:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 4955 transitions. [2019-12-07 19:06:41,375 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 4955 transitions. Word has length 27 [2019-12-07 19:06:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:06:41,375 INFO L462 AbstractCegarLoop]: Abstraction has 2055 states and 4955 transitions. [2019-12-07 19:06:41,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:06:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 4955 transitions. [2019-12-07 19:06:41,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 19:06:41,378 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:41,379 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] [2019-12-07 19:06:41,379 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:41,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:41,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1601520558, now seen corresponding path program 1 times [2019-12-07 19:06:41,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:41,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116554961] [2019-12-07 19:06:41,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:06:41,422 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 19:06:41,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116554961] [2019-12-07 19:06:41,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:06:41,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:06:41,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503358904] [2019-12-07 19:06:41,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:06:41,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:06:41,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:06:41,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:06:41,423 INFO L87 Difference]: Start difference. First operand 2055 states and 4955 transitions. Second operand 4 states. [2019-12-07 19:06:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:06:41,438 INFO L93 Difference]: Finished difference Result 966 states and 2264 transitions. [2019-12-07 19:06:41,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:06:41,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 19:06:41,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:06:41,439 INFO L225 Difference]: With dead ends: 966 [2019-12-07 19:06:41,439 INFO L226 Difference]: Without dead ends: 966 [2019-12-07 19:06:41,440 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 19:06:41,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-12-07 19:06:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 658. [2019-12-07 19:06:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-12-07 19:06:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1494 transitions. [2019-12-07 19:06:41,448 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1494 transitions. Word has length 28 [2019-12-07 19:06:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:06:41,449 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 1494 transitions. [2019-12-07 19:06:41,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:06:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1494 transitions. [2019-12-07 19:06:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 19:06:41,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:41,450 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 19:06:41,450 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:41,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:41,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1254925043, now seen corresponding path program 1 times [2019-12-07 19:06:41,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:41,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600720689] [2019-12-07 19:06:41,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:06:41,633 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 19:06:41,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600720689] [2019-12-07 19:06:41,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:06:41,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 19:06:41,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099579099] [2019-12-07 19:06:41,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:06:41,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:06:41,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:06:41,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:06:41,635 INFO L87 Difference]: Start difference. First operand 658 states and 1494 transitions. Second operand 11 states. [2019-12-07 19:06:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:06:42,865 INFO L93 Difference]: Finished difference Result 2669 states and 5959 transitions. [2019-12-07 19:06:42,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 19:06:42,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-12-07 19:06:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:06:42,867 INFO L225 Difference]: With dead ends: 2669 [2019-12-07 19:06:42,867 INFO L226 Difference]: Without dead ends: 1496 [2019-12-07 19:06:42,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=736, Unknown=0, NotChecked=0, Total=930 [2019-12-07 19:06:42,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2019-12-07 19:06:42,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 747. [2019-12-07 19:06:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-12-07 19:06:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1700 transitions. [2019-12-07 19:06:42,876 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1700 transitions. Word has length 42 [2019-12-07 19:06:42,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:06:42,876 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1700 transitions. [2019-12-07 19:06:42,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:06:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1700 transitions. [2019-12-07 19:06:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 19:06:42,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:42,877 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 19:06:42,877 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:42,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:42,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1487589225, now seen corresponding path program 2 times [2019-12-07 19:06:42,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:42,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375200227] [2019-12-07 19:06:42,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:06:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:06:42,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375200227] [2019-12-07 19:06:42,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:06:42,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:06:42,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450472260] [2019-12-07 19:06:42,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:06:42,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:06:42,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:06:42,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:06:42,990 INFO L87 Difference]: Start difference. First operand 747 states and 1700 transitions. Second operand 9 states. [2019-12-07 19:06:43,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:06:43,930 INFO L93 Difference]: Finished difference Result 1586 states and 3645 transitions. [2019-12-07 19:06:43,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 19:06:43,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-12-07 19:06:43,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:06:43,932 INFO L225 Difference]: With dead ends: 1586 [2019-12-07 19:06:43,932 INFO L226 Difference]: Without dead ends: 1344 [2019-12-07 19:06:43,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2019-12-07 19:06:43,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2019-12-07 19:06:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 748. [2019-12-07 19:06:43,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-12-07 19:06:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1701 transitions. [2019-12-07 19:06:43,941 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1701 transitions. Word has length 42 [2019-12-07 19:06:43,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:06:43,941 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1701 transitions. [2019-12-07 19:06:43,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:06:43,942 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1701 transitions. [2019-12-07 19:06:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 19:06:43,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:43,943 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 19:06:43,943 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:43,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:43,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1626226089, now seen corresponding path program 3 times [2019-12-07 19:06:43,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:43,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049505195] [2019-12-07 19:06:43,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:06:44,003 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 19:06:44,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049505195] [2019-12-07 19:06:44,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:06:44,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:06:44,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211392709] [2019-12-07 19:06:44,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:06:44,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:06:44,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:06:44,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:06:44,005 INFO L87 Difference]: Start difference. First operand 748 states and 1701 transitions. Second operand 4 states. [2019-12-07 19:06:44,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:06:44,017 INFO L93 Difference]: Finished difference Result 1157 states and 2653 transitions. [2019-12-07 19:06:44,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:06:44,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 19:06:44,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:06:44,018 INFO L225 Difference]: With dead ends: 1157 [2019-12-07 19:06:44,018 INFO L226 Difference]: Without dead ends: 437 [2019-12-07 19:06:44,018 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 19:06:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-07 19:06:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-12-07 19:06:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-12-07 19:06:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1000 transitions. [2019-12-07 19:06:44,021 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1000 transitions. Word has length 42 [2019-12-07 19:06:44,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:06:44,022 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 1000 transitions. [2019-12-07 19:06:44,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:06:44,022 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1000 transitions. [2019-12-07 19:06:44,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 19:06:44,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:06:44,023 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 19:06:44,023 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:06:44,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:06:44,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1127216463, now seen corresponding path program 4 times [2019-12-07 19:06:44,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:06:44,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477176263] [2019-12-07 19:06:44,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:06:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:06:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:06:44,082 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:06:44,082 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:06:44,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1633~0.base_35|) 0) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= v_~x$r_buff0_thd0~0_130 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1633~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1633~0.base_35|) |v_ULTIMATE.start_main_~#t1633~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1633~0.base_35| 4)) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (= |v_ULTIMATE.start_main_~#t1633~0.offset_24| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1633~0.base_35|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= (store .cse0 |v_ULTIMATE.start_main_~#t1633~0.base_35| 1) |v_#valid_59|) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, ULTIMATE.start_main_~#t1634~0.base=|v_ULTIMATE.start_main_~#t1634~0.base_35|, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ~y~0=v_~y~0_101, ULTIMATE.start_main_~#t1634~0.offset=|v_ULTIMATE.start_main_~#t1634~0.offset_24|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ULTIMATE.start_main_~#t1633~0.base=|v_ULTIMATE.start_main_~#t1633~0.base_35|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1633~0.offset=|v_ULTIMATE.start_main_~#t1633~0.offset_24|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1634~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1634~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1633~0.base, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_~#t1633~0.offset, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~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 19:06:44,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1634~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1634~0.base_10|) |v_ULTIMATE.start_main_~#t1634~0.offset_9| 1)) |v_#memory_int_9|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1634~0.base_10| 4) |v_#length_9|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1634~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1634~0.base_10|) (= |v_ULTIMATE.start_main_~#t1634~0.offset_9| 0) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1634~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t1634~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1634~0.base=|v_ULTIMATE.start_main_~#t1634~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1634~0.offset=|v_ULTIMATE.start_main_~#t1634~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1634~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1634~0.offset] because there is no mapped edge [2019-12-07 19:06:44,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= 1 ~x$r_buff0_thd2~0_Out1508029330) (= ~y~0_Out1508029330 1) (= ~x$r_buff1_thd2~0_Out1508029330 ~x$r_buff0_thd2~0_In1508029330) (= ~__unbuffered_p1_EAX~0_Out1508029330 ~y~0_Out1508029330) (= ~__unbuffered_p1_EBX~0_Out1508029330 ~y~0_Out1508029330) (= ~x$r_buff0_thd1~0_In1508029330 ~x$r_buff1_thd1~0_Out1508029330) (= ~x$r_buff1_thd0~0_Out1508029330 ~x$r_buff0_thd0~0_In1508029330) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1508029330))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1508029330, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1508029330, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1508029330, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1508029330} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1508029330, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1508029330, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out1508029330, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1508029330, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out1508029330, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1508029330, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1508029330, ~y~0=~y~0_Out1508029330, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1508029330, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1508029330} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 19:06:44,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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 19:06:44,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1502127011 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite23_In1502127011| |P0Thread1of1ForFork1_#t~ite23_Out1502127011|) (= ~x$r_buff1_thd1~0_In1502127011 |P0Thread1of1ForFork1_#t~ite24_Out1502127011|) (= |P0Thread1of1ForFork1_#t~ite22_In1502127011| |P0Thread1of1ForFork1_#t~ite22_Out1502127011|) (not .cse0)) (let ((.cse1 (not (= 0 (mod ~x$r_buff0_thd1~0_In1502127011 256))))) (and (or .cse1 (not (= 0 (mod ~x$w_buff1_used~0_In1502127011 256)))) (= |P0Thread1of1ForFork1_#t~ite22_Out1502127011| 0) (= |P0Thread1of1ForFork1_#t~ite23_Out1502127011| |P0Thread1of1ForFork1_#t~ite24_Out1502127011|) .cse0 (not (= (mod ~x$w_buff0_used~0_In1502127011 256) 0)) (= |P0Thread1of1ForFork1_#t~ite22_Out1502127011| |P0Thread1of1ForFork1_#t~ite23_Out1502127011|) (or .cse1 (not (= (mod ~x$r_buff1_thd1~0_In1502127011 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1502127011, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1502127011, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1502127011, ~weak$$choice2~0=~weak$$choice2~0_In1502127011, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In1502127011|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1502127011, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In1502127011|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1502127011, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1502127011, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1502127011, ~weak$$choice2~0=~weak$$choice2~0_In1502127011, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out1502127011|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out1502127011|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out1502127011|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1502127011} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 19:06:44,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 19:06:44,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2063663164 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-2063663164 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-2063663164|)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-2063663164| ~x$w_buff0_used~0_In-2063663164) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2063663164, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2063663164} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2063663164, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-2063663164|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2063663164} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 19:06:44,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In302259156 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In302259156 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In302259156 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In302259156 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In302259156 |P1Thread1of1ForFork0_#t~ite29_Out302259156|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out302259156|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In302259156, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In302259156, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In302259156, ~x$w_buff0_used~0=~x$w_buff0_used~0_In302259156} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In302259156, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In302259156, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In302259156, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out302259156|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In302259156} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 19:06:44,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_In1203923083 ~x$r_buff0_thd2~0_Out1203923083)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1203923083 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1203923083 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~x$r_buff0_thd2~0_Out1203923083) (not .cse2) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1203923083, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1203923083} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1203923083|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1203923083, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1203923083} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:06:44,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1842127326 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1842127326 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1842127326 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1842127326 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out1842127326| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out1842127326| ~x$r_buff1_thd2~0_In1842127326)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1842127326, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1842127326, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1842127326, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1842127326} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1842127326|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1842127326, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1842127326, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1842127326, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1842127326} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:06:44,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 19:06:44,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:06:44,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-2065347599 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2065347599 256) 0))) (or (and (= ~x~0_In-2065347599 |ULTIMATE.start_main_#t~ite34_Out-2065347599|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-2065347599 |ULTIMATE.start_main_#t~ite34_Out-2065347599|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2065347599, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2065347599, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2065347599, ~x~0=~x~0_In-2065347599} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-2065347599, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2065347599, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2065347599, ~x~0=~x~0_In-2065347599, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-2065347599|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 19:06:44,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 19:06:44,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In871628902 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In871628902 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In871628902 |ULTIMATE.start_main_#t~ite36_Out871628902|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out871628902| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In871628902, ~x$w_buff0_used~0=~x$w_buff0_used~0_In871628902} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In871628902, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out871628902|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In871628902} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 19:06:44,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-759190870 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-759190870 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-759190870 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-759190870 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-759190870 |ULTIMATE.start_main_#t~ite37_Out-759190870|)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-759190870|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-759190870, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-759190870, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-759190870, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-759190870} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-759190870, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-759190870, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-759190870|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-759190870, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-759190870} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 19:06:44,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1720605764 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1720605764 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out1720605764|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In1720605764 |ULTIMATE.start_main_#t~ite38_Out1720605764|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1720605764, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1720605764} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1720605764, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1720605764|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1720605764} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 19:06:44,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In959740999 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In959740999 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In959740999 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In959740999 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out959740999| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite39_Out959740999| ~x$r_buff1_thd0~0_In959740999) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In959740999, ~x$w_buff1_used~0=~x$w_buff1_used~0_In959740999, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In959740999, ~x$w_buff0_used~0=~x$w_buff0_used~0_In959740999} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In959740999, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out959740999|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In959740999, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In959740999, ~x$w_buff0_used~0=~x$w_buff0_used~0_In959740999} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 19:06:44,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:06:44,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:06:44 BasicIcfg [2019-12-07 19:06:44,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:06:44,142 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:06:44,142 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:06:44,142 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:06:44,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:06:34" (3/4) ... [2019-12-07 19:06:44,145 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:06:44,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1633~0.base_35|) 0) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= v_~x$r_buff0_thd0~0_130 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1633~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1633~0.base_35|) |v_ULTIMATE.start_main_~#t1633~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1633~0.base_35| 4)) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (= |v_ULTIMATE.start_main_~#t1633~0.offset_24| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1633~0.base_35|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= (store .cse0 |v_ULTIMATE.start_main_~#t1633~0.base_35| 1) |v_#valid_59|) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, ULTIMATE.start_main_~#t1634~0.base=|v_ULTIMATE.start_main_~#t1634~0.base_35|, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ~y~0=v_~y~0_101, ULTIMATE.start_main_~#t1634~0.offset=|v_ULTIMATE.start_main_~#t1634~0.offset_24|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ULTIMATE.start_main_~#t1633~0.base=|v_ULTIMATE.start_main_~#t1633~0.base_35|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1633~0.offset=|v_ULTIMATE.start_main_~#t1633~0.offset_24|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1634~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1634~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1633~0.base, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_~#t1633~0.offset, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~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 19:06:44,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1634~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1634~0.base_10|) |v_ULTIMATE.start_main_~#t1634~0.offset_9| 1)) |v_#memory_int_9|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1634~0.base_10| 4) |v_#length_9|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1634~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1634~0.base_10|) (= |v_ULTIMATE.start_main_~#t1634~0.offset_9| 0) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1634~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t1634~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1634~0.base=|v_ULTIMATE.start_main_~#t1634~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1634~0.offset=|v_ULTIMATE.start_main_~#t1634~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1634~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1634~0.offset] because there is no mapped edge [2019-12-07 19:06:44,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= 1 ~x$r_buff0_thd2~0_Out1508029330) (= ~y~0_Out1508029330 1) (= ~x$r_buff1_thd2~0_Out1508029330 ~x$r_buff0_thd2~0_In1508029330) (= ~__unbuffered_p1_EAX~0_Out1508029330 ~y~0_Out1508029330) (= ~__unbuffered_p1_EBX~0_Out1508029330 ~y~0_Out1508029330) (= ~x$r_buff0_thd1~0_In1508029330 ~x$r_buff1_thd1~0_Out1508029330) (= ~x$r_buff1_thd0~0_Out1508029330 ~x$r_buff0_thd0~0_In1508029330) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1508029330))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1508029330, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1508029330, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1508029330, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1508029330} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1508029330, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1508029330, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out1508029330, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1508029330, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out1508029330, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1508029330, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1508029330, ~y~0=~y~0_Out1508029330, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1508029330, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1508029330} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 19:06:44,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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 19:06:44,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1502127011 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite23_In1502127011| |P0Thread1of1ForFork1_#t~ite23_Out1502127011|) (= ~x$r_buff1_thd1~0_In1502127011 |P0Thread1of1ForFork1_#t~ite24_Out1502127011|) (= |P0Thread1of1ForFork1_#t~ite22_In1502127011| |P0Thread1of1ForFork1_#t~ite22_Out1502127011|) (not .cse0)) (let ((.cse1 (not (= 0 (mod ~x$r_buff0_thd1~0_In1502127011 256))))) (and (or .cse1 (not (= 0 (mod ~x$w_buff1_used~0_In1502127011 256)))) (= |P0Thread1of1ForFork1_#t~ite22_Out1502127011| 0) (= |P0Thread1of1ForFork1_#t~ite23_Out1502127011| |P0Thread1of1ForFork1_#t~ite24_Out1502127011|) .cse0 (not (= (mod ~x$w_buff0_used~0_In1502127011 256) 0)) (= |P0Thread1of1ForFork1_#t~ite22_Out1502127011| |P0Thread1of1ForFork1_#t~ite23_Out1502127011|) (or .cse1 (not (= (mod ~x$r_buff1_thd1~0_In1502127011 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1502127011, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1502127011, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1502127011, ~weak$$choice2~0=~weak$$choice2~0_In1502127011, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In1502127011|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1502127011, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In1502127011|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1502127011, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1502127011, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1502127011, ~weak$$choice2~0=~weak$$choice2~0_In1502127011, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out1502127011|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out1502127011|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out1502127011|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1502127011} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 19:06:44,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 19:06:44,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2063663164 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-2063663164 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-2063663164|)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-2063663164| ~x$w_buff0_used~0_In-2063663164) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2063663164, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2063663164} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2063663164, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-2063663164|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2063663164} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 19:06:44,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In302259156 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In302259156 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In302259156 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In302259156 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In302259156 |P1Thread1of1ForFork0_#t~ite29_Out302259156|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out302259156|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In302259156, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In302259156, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In302259156, ~x$w_buff0_used~0=~x$w_buff0_used~0_In302259156} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In302259156, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In302259156, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In302259156, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out302259156|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In302259156} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 19:06:44,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_In1203923083 ~x$r_buff0_thd2~0_Out1203923083)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1203923083 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1203923083 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~x$r_buff0_thd2~0_Out1203923083) (not .cse2) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1203923083, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1203923083} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1203923083|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1203923083, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1203923083} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:06:44,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1842127326 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1842127326 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1842127326 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1842127326 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out1842127326| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out1842127326| ~x$r_buff1_thd2~0_In1842127326)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1842127326, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1842127326, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1842127326, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1842127326} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1842127326|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1842127326, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1842127326, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1842127326, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1842127326} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:06:44,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 19:06:44,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:06:44,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-2065347599 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2065347599 256) 0))) (or (and (= ~x~0_In-2065347599 |ULTIMATE.start_main_#t~ite34_Out-2065347599|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-2065347599 |ULTIMATE.start_main_#t~ite34_Out-2065347599|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2065347599, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2065347599, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2065347599, ~x~0=~x~0_In-2065347599} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-2065347599, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2065347599, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2065347599, ~x~0=~x~0_In-2065347599, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-2065347599|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 19:06:44,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 19:06:44,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In871628902 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In871628902 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In871628902 |ULTIMATE.start_main_#t~ite36_Out871628902|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out871628902| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In871628902, ~x$w_buff0_used~0=~x$w_buff0_used~0_In871628902} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In871628902, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out871628902|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In871628902} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 19:06:44,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-759190870 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-759190870 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-759190870 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-759190870 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-759190870 |ULTIMATE.start_main_#t~ite37_Out-759190870|)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-759190870|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-759190870, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-759190870, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-759190870, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-759190870} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-759190870, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-759190870, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-759190870|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-759190870, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-759190870} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 19:06:44,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1720605764 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1720605764 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out1720605764|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In1720605764 |ULTIMATE.start_main_#t~ite38_Out1720605764|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1720605764, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1720605764} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1720605764, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1720605764|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1720605764} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 19:06:44,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In959740999 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In959740999 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In959740999 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In959740999 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out959740999| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite39_Out959740999| ~x$r_buff1_thd0~0_In959740999) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In959740999, ~x$w_buff1_used~0=~x$w_buff1_used~0_In959740999, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In959740999, ~x$w_buff0_used~0=~x$w_buff0_used~0_In959740999} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In959740999, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out959740999|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In959740999, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In959740999, ~x$w_buff0_used~0=~x$w_buff0_used~0_In959740999} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 19:06:44,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:06:44,210 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d84d7c35-ddf0-4e04-a4e7-fd86d8049359/bin/utaipan/witness.graphml [2019-12-07 19:06:44,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:06:44,212 INFO L168 Benchmark]: Toolchain (without parser) took 10714.86 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 457.2 MB). Free memory was 938.0 MB in the beginning and 808.4 MB in the end (delta: 129.6 MB). Peak memory consumption was 586.8 MB. Max. memory is 11.5 GB. [2019-12-07 19:06:44,212 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:06:44,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 76.5 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -106.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:06:44,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.85 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:06:44,213 INFO L168 Benchmark]: Boogie Preprocessor took 24.83 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 19:06:44,214 INFO L168 Benchmark]: RCFGBuilder took 371.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 993.6 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:06:44,214 INFO L168 Benchmark]: TraceAbstraction took 9828.74 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 380.6 MB). Free memory was 988.3 MB in the beginning and 835.8 MB in the end (delta: 152.5 MB). Peak memory consumption was 533.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:06:44,215 INFO L168 Benchmark]: Witness Printer took 68.51 ms. Allocated memory is still 1.5 GB. Free memory was 835.8 MB in the beginning and 808.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:06:44,217 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 76.5 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -106.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.85 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.83 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. * RCFGBuilder took 371.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 993.6 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9828.74 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 380.6 MB). Free memory was 988.3 MB in the beginning and 835.8 MB in the end (delta: 152.5 MB). Peak memory consumption was 533.1 MB. Max. memory is 11.5 GB. * Witness Printer took 68.51 ms. Allocated memory is still 1.5 GB. Free memory was 835.8 MB in the beginning and 808.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.6s, 136 ProgramPointsBefore, 65 ProgramPointsAfterwards, 164 TransitionsBefore, 75 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 21 ChoiceCompositions, 4335 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 39492 CheckedPairsTotal, 102 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L802] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=0, x$r_buff0_thd2=1, 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=2] [L736] 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 [!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)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=0, x$r_buff0_thd2=1, 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=2] [L736] 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) [L737] 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_p1_EAX=1, __unbuffered_p1_EBX=1, 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_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))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2] [L777] EXPR 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_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))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2] [L737] 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)) [L738] 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_p1_EAX=1, __unbuffered_p1_EBX=1, 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_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))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2] [L738] 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)) [L739] 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_p1_EAX=1, __unbuffered_p1_EBX=1, 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_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))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2] [L739] 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)) [L740] 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_p1_EAX=1, __unbuffered_p1_EBX=1, 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_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))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2] [L740] 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)) [L742] 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)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=0, x$r_buff0_thd2=1, 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=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L808] 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=0, x$r_buff0_thd2=1, 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=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 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 [L811] 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, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.6s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1812 SDtfs, 1925 SDslu, 3550 SDs, 0 SdLazy, 3592 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15319occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 9363 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 345 ConstructedInterpolants, 0 QuantifiedInterpolants, 71517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...