./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix006_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a7cd95c1-3715-47ac-90cf-7134d8c98ae1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a7cd95c1-3715-47ac-90cf-7134d8c98ae1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a7cd95c1-3715-47ac-90cf-7134d8c98ae1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a7cd95c1-3715-47ac-90cf-7134d8c98ae1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a7cd95c1-3715-47ac-90cf-7134d8c98ae1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a7cd95c1-3715-47ac-90cf-7134d8c98ae1/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a65c501805b606e984a78531b422cb695e27559c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 17:55:19,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:55:19,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:55:19,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:55:19,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:55:19,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:55:19,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:55:19,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:55:19,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:55:19,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:55:19,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:55:19,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:55:19,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:55:19,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:55:19,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:55:19,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:55:19,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:55:19,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:55:19,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:55:19,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:55:19,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:55:19,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:55:19,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:55:19,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:55:19,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:55:19,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:55:19,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:55:19,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:55:19,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:55:19,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:55:19,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:55:19,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:55:19,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:55:19,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:55:19,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:55:19,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:55:19,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:55:19,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:55:19,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:55:19,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:55:19,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:55:19,923 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a7cd95c1-3715-47ac-90cf-7134d8c98ae1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:55:19,933 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:55:19,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:55:19,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:55:19,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:55:19,934 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:55:19,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:55:19,934 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:55:19,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:55:19,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:55:19,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:55:19,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:55:19,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:55:19,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:55:19,935 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:55:19,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:55:19,935 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:55:19,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:55:19,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:55:19,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:55:19,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:55:19,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:55:19,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:55:19,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:55:19,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:55:19,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:55:19,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:55:19,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:55:19,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:55:19,937 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:55:19,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_a7cd95c1-3715-47ac-90cf-7134d8c98ae1/bin/uautomizer 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 -> Automizer 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 -> a65c501805b606e984a78531b422cb695e27559c [2019-12-07 17:55:20,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:55:20,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:55:20,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:55:20,043 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:55:20,044 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:55:20,044 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a7cd95c1-3715-47ac-90cf-7134d8c98ae1/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix006_pso.opt.i [2019-12-07 17:55:20,079 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7cd95c1-3715-47ac-90cf-7134d8c98ae1/bin/uautomizer/data/93c2c0b65/a7bbfa23644849fcaf7e5fe5cde3e458/FLAGf28a3970b [2019-12-07 17:55:20,516 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:55:20,516 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a7cd95c1-3715-47ac-90cf-7134d8c98ae1/sv-benchmarks/c/pthread-wmm/mix006_pso.opt.i [2019-12-07 17:55:20,526 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7cd95c1-3715-47ac-90cf-7134d8c98ae1/bin/uautomizer/data/93c2c0b65/a7bbfa23644849fcaf7e5fe5cde3e458/FLAGf28a3970b [2019-12-07 17:55:20,535 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a7cd95c1-3715-47ac-90cf-7134d8c98ae1/bin/uautomizer/data/93c2c0b65/a7bbfa23644849fcaf7e5fe5cde3e458 [2019-12-07 17:55:20,536 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:55:20,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:55:20,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:55:20,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:55:20,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:55:20,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:55:20" (1/1) ... [2019-12-07 17:55:20,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:20, skipping insertion in model container [2019-12-07 17:55:20,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:55:20" (1/1) ... [2019-12-07 17:55:20,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:55:20,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:55:20,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:55:20,870 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:55:20,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:55:20,970 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:55:20,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:20 WrapperNode [2019-12-07 17:55:20,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:55:20,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:55:20,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:55:20,971 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:55:20,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:20" (1/1) ... [2019-12-07 17:55:20,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:20" (1/1) ... [2019-12-07 17:55:21,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:55:21,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:55:21,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:55:21,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:55:21,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:20" (1/1) ... [2019-12-07 17:55:21,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:20" (1/1) ... [2019-12-07 17:55:21,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:20" (1/1) ... [2019-12-07 17:55:21,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:20" (1/1) ... [2019-12-07 17:55:21,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:20" (1/1) ... [2019-12-07 17:55:21,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:20" (1/1) ... [2019-12-07 17:55:21,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:20" (1/1) ... [2019-12-07 17:55:21,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:55:21,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:55:21,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:55:21,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:55:21,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7cd95c1-3715-47ac-90cf-7134d8c98ae1/bin/uautomizer/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 17:55:21,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:55:21,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:55:21,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:55:21,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:55:21,089 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:55:21,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:55:21,089 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:55:21,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:55:21,089 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:55:21,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:55:21,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:55:21,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:55:21,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:55:21,092 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 17:55:21,493 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:55:21,493 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:55:21,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:55:21 BoogieIcfgContainer [2019-12-07 17:55:21,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:55:21,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:55:21,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:55:21,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:55:21,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:55:20" (1/3) ... [2019-12-07 17:55:21,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf406ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:55:21, skipping insertion in model container [2019-12-07 17:55:21,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:20" (2/3) ... [2019-12-07 17:55:21,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf406ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:55:21, skipping insertion in model container [2019-12-07 17:55:21,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:55:21" (3/3) ... [2019-12-07 17:55:21,499 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_pso.opt.i [2019-12-07 17:55:21,505 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:55:21,505 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:55:21,510 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:55:21,511 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:55:21,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,539 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,539 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,540 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,540 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,551 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,551 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,551 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,551 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,551 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:55:21,577 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 17:55:21,591 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:55:21,591 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:55:21,591 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:55:21,592 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:55:21,592 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:55:21,592 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:55:21,592 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:55:21,592 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:55:21,603 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 241 transitions [2019-12-07 17:55:21,604 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-07 17:55:21,683 INFO L134 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-07 17:55:21,683 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:55:21,698 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 923 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 17:55:21,719 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-07 17:55:21,763 INFO L134 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-07 17:55:21,763 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:55:21,771 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 923 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 17:55:21,795 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 17:55:21,796 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:55:25,099 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 17:55:25,205 INFO L206 etLargeBlockEncoding]: Checked pairs total: 128241 [2019-12-07 17:55:25,205 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 17:55:25,207 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 110 places, 133 transitions [2019-12-07 17:55:28,297 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47186 states. [2019-12-07 17:55:28,298 INFO L276 IsEmpty]: Start isEmpty. Operand 47186 states. [2019-12-07 17:55:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 17:55:28,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:28,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:28,303 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:28,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:28,307 INFO L82 PathProgramCache]: Analyzing trace with hash -137140126, now seen corresponding path program 1 times [2019-12-07 17:55:28,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:28,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74618826] [2019-12-07 17:55:28,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:28,466 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 17:55:28,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74618826] [2019-12-07 17:55:28,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:28,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:55:28,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704091513] [2019-12-07 17:55:28,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:28,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:28,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:28,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:28,483 INFO L87 Difference]: Start difference. First operand 47186 states. Second operand 3 states. [2019-12-07 17:55:28,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:28,872 INFO L93 Difference]: Finished difference Result 46894 states and 192684 transitions. [2019-12-07 17:55:28,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:28,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 17:55:28,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:29,140 INFO L225 Difference]: With dead ends: 46894 [2019-12-07 17:55:29,140 INFO L226 Difference]: Without dead ends: 43674 [2019-12-07 17:55:29,141 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 17:55:29,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43674 states. [2019-12-07 17:55:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43674 to 43674. [2019-12-07 17:55:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43674 states. [2019-12-07 17:55:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43674 states to 43674 states and 179330 transitions. [2019-12-07 17:55:30,724 INFO L78 Accepts]: Start accepts. Automaton has 43674 states and 179330 transitions. Word has length 7 [2019-12-07 17:55:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:30,726 INFO L462 AbstractCegarLoop]: Abstraction has 43674 states and 179330 transitions. [2019-12-07 17:55:30,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 43674 states and 179330 transitions. [2019-12-07 17:55:30,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:55:30,730 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:30,730 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:30,730 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:30,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:30,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1070314357, now seen corresponding path program 1 times [2019-12-07 17:55:30,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:30,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116770112] [2019-12-07 17:55:30,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:30,788 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 17:55:30,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116770112] [2019-12-07 17:55:30,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:30,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:30,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003243389] [2019-12-07 17:55:30,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:55:30,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:30,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:55:30,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:55:30,790 INFO L87 Difference]: Start difference. First operand 43674 states and 179330 transitions. Second operand 4 states. [2019-12-07 17:55:31,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:31,284 INFO L93 Difference]: Finished difference Result 69642 states and 274292 transitions. [2019-12-07 17:55:31,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:55:31,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:55:31,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:31,549 INFO L225 Difference]: With dead ends: 69642 [2019-12-07 17:55:31,549 INFO L226 Difference]: Without dead ends: 69610 [2019-12-07 17:55:31,550 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 17:55:32,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69610 states. [2019-12-07 17:55:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69610 to 67954. [2019-12-07 17:55:33,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67954 states. [2019-12-07 17:55:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67954 states to 67954 states and 269064 transitions. [2019-12-07 17:55:33,465 INFO L78 Accepts]: Start accepts. Automaton has 67954 states and 269064 transitions. Word has length 13 [2019-12-07 17:55:33,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:33,465 INFO L462 AbstractCegarLoop]: Abstraction has 67954 states and 269064 transitions. [2019-12-07 17:55:33,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:55:33,465 INFO L276 IsEmpty]: Start isEmpty. Operand 67954 states and 269064 transitions. [2019-12-07 17:55:33,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:55:33,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:33,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:33,469 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:33,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:33,470 INFO L82 PathProgramCache]: Analyzing trace with hash 484016506, now seen corresponding path program 1 times [2019-12-07 17:55:33,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:33,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956851253] [2019-12-07 17:55:33,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:33,514 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 17:55:33,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956851253] [2019-12-07 17:55:33,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:33,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:33,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879019295] [2019-12-07 17:55:33,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:55:33,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:33,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:55:33,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:55:33,516 INFO L87 Difference]: Start difference. First operand 67954 states and 269064 transitions. Second operand 4 states. [2019-12-07 17:55:33,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:33,997 INFO L93 Difference]: Finished difference Result 86818 states and 338660 transitions. [2019-12-07 17:55:33,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:55:33,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 17:55:33,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:34,186 INFO L225 Difference]: With dead ends: 86818 [2019-12-07 17:55:34,186 INFO L226 Difference]: Without dead ends: 86790 [2019-12-07 17:55:34,186 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 17:55:36,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86790 states. [2019-12-07 17:55:37,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86790 to 77804. [2019-12-07 17:55:37,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77804 states. [2019-12-07 17:55:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77804 states to 77804 states and 306271 transitions. [2019-12-07 17:55:37,296 INFO L78 Accepts]: Start accepts. Automaton has 77804 states and 306271 transitions. Word has length 16 [2019-12-07 17:55:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:37,296 INFO L462 AbstractCegarLoop]: Abstraction has 77804 states and 306271 transitions. [2019-12-07 17:55:37,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:55:37,296 INFO L276 IsEmpty]: Start isEmpty. Operand 77804 states and 306271 transitions. [2019-12-07 17:55:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:55:37,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:37,300 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 17:55:37,300 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:37,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:37,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2119638279, now seen corresponding path program 1 times [2019-12-07 17:55:37,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:37,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980873145] [2019-12-07 17:55:37,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:37,334 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 17:55:37,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980873145] [2019-12-07 17:55:37,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:37,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:37,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197102106] [2019-12-07 17:55:37,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:37,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:37,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:37,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:37,335 INFO L87 Difference]: Start difference. First operand 77804 states and 306271 transitions. Second operand 3 states. [2019-12-07 17:55:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:37,911 INFO L93 Difference]: Finished difference Result 129752 states and 490387 transitions. [2019-12-07 17:55:37,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:37,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:55:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:38,215 INFO L225 Difference]: With dead ends: 129752 [2019-12-07 17:55:38,215 INFO L226 Difference]: Without dead ends: 129752 [2019-12-07 17:55:38,215 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 17:55:39,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129752 states. [2019-12-07 17:55:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129752 to 115674. [2019-12-07 17:55:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115674 states. [2019-12-07 17:55:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115674 states to 115674 states and 443292 transitions. [2019-12-07 17:55:41,519 INFO L78 Accepts]: Start accepts. Automaton has 115674 states and 443292 transitions. Word has length 17 [2019-12-07 17:55:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:41,520 INFO L462 AbstractCegarLoop]: Abstraction has 115674 states and 443292 transitions. [2019-12-07 17:55:41,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:41,520 INFO L276 IsEmpty]: Start isEmpty. Operand 115674 states and 443292 transitions. [2019-12-07 17:55:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:55:41,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:41,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:41,528 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:41,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:41,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1223807206, now seen corresponding path program 1 times [2019-12-07 17:55:41,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:41,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389821662] [2019-12-07 17:55:41,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:41,566 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 17:55:41,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389821662] [2019-12-07 17:55:41,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:41,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:41,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833873925] [2019-12-07 17:55:41,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:41,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:41,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:41,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:41,567 INFO L87 Difference]: Start difference. First operand 115674 states and 443292 transitions. Second operand 3 states. [2019-12-07 17:55:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:42,040 INFO L93 Difference]: Finished difference Result 115674 states and 437844 transitions. [2019-12-07 17:55:42,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:42,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:55:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:42,308 INFO L225 Difference]: With dead ends: 115674 [2019-12-07 17:55:42,308 INFO L226 Difference]: Without dead ends: 115674 [2019-12-07 17:55:42,309 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 17:55:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115674 states. [2019-12-07 17:55:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115674 to 114698. [2019-12-07 17:55:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114698 states. [2019-12-07 17:55:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114698 states to 114698 states and 434576 transitions. [2019-12-07 17:55:46,418 INFO L78 Accepts]: Start accepts. Automaton has 114698 states and 434576 transitions. Word has length 18 [2019-12-07 17:55:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:46,418 INFO L462 AbstractCegarLoop]: Abstraction has 114698 states and 434576 transitions. [2019-12-07 17:55:46,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:46,419 INFO L276 IsEmpty]: Start isEmpty. Operand 114698 states and 434576 transitions. [2019-12-07 17:55:46,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:55:46,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:46,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:46,425 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:46,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:46,425 INFO L82 PathProgramCache]: Analyzing trace with hash -738098229, now seen corresponding path program 1 times [2019-12-07 17:55:46,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:46,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106776895] [2019-12-07 17:55:46,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:46,450 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 17:55:46,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106776895] [2019-12-07 17:55:46,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:46,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:46,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416758835] [2019-12-07 17:55:46,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:46,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:46,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:46,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:46,451 INFO L87 Difference]: Start difference. First operand 114698 states and 434576 transitions. Second operand 3 states. [2019-12-07 17:55:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:46,665 INFO L93 Difference]: Finished difference Result 62824 states and 207017 transitions. [2019-12-07 17:55:46,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:46,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:55:46,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:46,775 INFO L225 Difference]: With dead ends: 62824 [2019-12-07 17:55:46,775 INFO L226 Difference]: Without dead ends: 62824 [2019-12-07 17:55:46,775 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 17:55:47,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62824 states. [2019-12-07 17:55:47,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62824 to 62824. [2019-12-07 17:55:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62824 states. [2019-12-07 17:55:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62824 states to 62824 states and 207017 transitions. [2019-12-07 17:55:48,016 INFO L78 Accepts]: Start accepts. Automaton has 62824 states and 207017 transitions. Word has length 18 [2019-12-07 17:55:48,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:48,016 INFO L462 AbstractCegarLoop]: Abstraction has 62824 states and 207017 transitions. [2019-12-07 17:55:48,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 62824 states and 207017 transitions. [2019-12-07 17:55:48,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:55:48,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:48,020 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 17:55:48,020 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:48,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:48,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1584397916, now seen corresponding path program 1 times [2019-12-07 17:55:48,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:48,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081682600] [2019-12-07 17:55:48,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:48,071 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 17:55:48,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081682600] [2019-12-07 17:55:48,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:48,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:48,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465617750] [2019-12-07 17:55:48,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:48,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:48,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:48,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:48,072 INFO L87 Difference]: Start difference. First operand 62824 states and 207017 transitions. Second operand 3 states. [2019-12-07 17:55:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:48,663 INFO L93 Difference]: Finished difference Result 109688 states and 362410 transitions. [2019-12-07 17:55:48,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:48,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 17:55:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:48,856 INFO L225 Difference]: With dead ends: 109688 [2019-12-07 17:55:48,856 INFO L226 Difference]: Without dead ends: 109238 [2019-12-07 17:55:48,857 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 17:55:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109238 states. [2019-12-07 17:55:50,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109238 to 109036. [2019-12-07 17:55:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109036 states. [2019-12-07 17:55:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109036 states to 109036 states and 360772 transitions. [2019-12-07 17:55:50,940 INFO L78 Accepts]: Start accepts. Automaton has 109036 states and 360772 transitions. Word has length 19 [2019-12-07 17:55:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:50,940 INFO L462 AbstractCegarLoop]: Abstraction has 109036 states and 360772 transitions. [2019-12-07 17:55:50,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 109036 states and 360772 transitions. [2019-12-07 17:55:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:55:50,946 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:50,946 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 17:55:50,946 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:50,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:50,947 INFO L82 PathProgramCache]: Analyzing trace with hash -249657895, now seen corresponding path program 1 times [2019-12-07 17:55:50,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:50,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759724071] [2019-12-07 17:55:50,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:50,975 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 17:55:50,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759724071] [2019-12-07 17:55:50,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:50,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:50,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229667277] [2019-12-07 17:55:50,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:55:50,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:50,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:55:50,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:55:50,977 INFO L87 Difference]: Start difference. First operand 109036 states and 360772 transitions. Second operand 4 states. [2019-12-07 17:55:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:51,601 INFO L93 Difference]: Finished difference Result 134774 states and 440343 transitions. [2019-12-07 17:55:51,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:55:51,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 17:55:51,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:51,848 INFO L225 Difference]: With dead ends: 134774 [2019-12-07 17:55:51,848 INFO L226 Difference]: Without dead ends: 134757 [2019-12-07 17:55:51,848 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 17:55:52,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134757 states. [2019-12-07 17:55:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134757 to 110506. [2019-12-07 17:55:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110506 states. [2019-12-07 17:55:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110506 states to 110506 states and 365533 transitions. [2019-12-07 17:55:54,379 INFO L78 Accepts]: Start accepts. Automaton has 110506 states and 365533 transitions. Word has length 19 [2019-12-07 17:55:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:54,379 INFO L462 AbstractCegarLoop]: Abstraction has 110506 states and 365533 transitions. [2019-12-07 17:55:54,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:55:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 110506 states and 365533 transitions. [2019-12-07 17:55:54,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:55:54,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:54,386 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:54,386 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:54,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:54,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1279291861, now seen corresponding path program 1 times [2019-12-07 17:55:54,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:54,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312240487] [2019-12-07 17:55:54,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:54,421 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 17:55:54,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312240487] [2019-12-07 17:55:54,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:54,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:54,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802759547] [2019-12-07 17:55:54,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:55:54,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:54,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:55:54,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:55:54,422 INFO L87 Difference]: Start difference. First operand 110506 states and 365533 transitions. Second operand 4 states. [2019-12-07 17:55:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:54,469 INFO L93 Difference]: Finished difference Result 14106 states and 37018 transitions. [2019-12-07 17:55:54,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:55:54,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 17:55:54,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:54,484 INFO L225 Difference]: With dead ends: 14106 [2019-12-07 17:55:54,485 INFO L226 Difference]: Without dead ends: 14106 [2019-12-07 17:55:54,485 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 17:55:54,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14106 states. [2019-12-07 17:55:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14106 to 11862. [2019-12-07 17:55:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11862 states. [2019-12-07 17:55:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11862 states to 11862 states and 31334 transitions. [2019-12-07 17:55:54,620 INFO L78 Accepts]: Start accepts. Automaton has 11862 states and 31334 transitions. Word has length 20 [2019-12-07 17:55:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:54,620 INFO L462 AbstractCegarLoop]: Abstraction has 11862 states and 31334 transitions. [2019-12-07 17:55:54,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:55:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 11862 states and 31334 transitions. [2019-12-07 17:55:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 17:55:54,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:54,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:54,627 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:54,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:54,627 INFO L82 PathProgramCache]: Analyzing trace with hash -798739535, now seen corresponding path program 1 times [2019-12-07 17:55:54,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:54,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615913281] [2019-12-07 17:55:54,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:54,661 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 17:55:54,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615913281] [2019-12-07 17:55:54,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:54,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:54,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055956880] [2019-12-07 17:55:54,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:55:54,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:54,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:55:54,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:55:54,663 INFO L87 Difference]: Start difference. First operand 11862 states and 31334 transitions. Second operand 5 states. [2019-12-07 17:55:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:54,924 INFO L93 Difference]: Finished difference Result 16237 states and 41412 transitions. [2019-12-07 17:55:54,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:55:54,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 17:55:54,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:54,939 INFO L225 Difference]: With dead ends: 16237 [2019-12-07 17:55:54,939 INFO L226 Difference]: Without dead ends: 16236 [2019-12-07 17:55:54,939 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 17:55:54,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16236 states. [2019-12-07 17:55:55,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16236 to 14979. [2019-12-07 17:55:55,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14979 states. [2019-12-07 17:55:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14979 states to 14979 states and 38777 transitions. [2019-12-07 17:55:55,114 INFO L78 Accepts]: Start accepts. Automaton has 14979 states and 38777 transitions. Word has length 31 [2019-12-07 17:55:55,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:55,115 INFO L462 AbstractCegarLoop]: Abstraction has 14979 states and 38777 transitions. [2019-12-07 17:55:55,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:55:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 14979 states and 38777 transitions. [2019-12-07 17:55:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:55:55,124 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:55,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:55,124 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:55,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:55,124 INFO L82 PathProgramCache]: Analyzing trace with hash 283122302, now seen corresponding path program 1 times [2019-12-07 17:55:55,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:55,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166716166] [2019-12-07 17:55:55,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:55,150 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 17:55:55,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166716166] [2019-12-07 17:55:55,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:55,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:55,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333177553] [2019-12-07 17:55:55,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:55,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:55,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:55,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:55,151 INFO L87 Difference]: Start difference. First operand 14979 states and 38777 transitions. Second operand 3 states. [2019-12-07 17:55:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:55,220 INFO L93 Difference]: Finished difference Result 15958 states and 39077 transitions. [2019-12-07 17:55:55,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:55,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 17:55:55,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:55,233 INFO L225 Difference]: With dead ends: 15958 [2019-12-07 17:55:55,234 INFO L226 Difference]: Without dead ends: 15958 [2019-12-07 17:55:55,234 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 17:55:55,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15958 states. [2019-12-07 17:55:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15958 to 15071. [2019-12-07 17:55:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15071 states. [2019-12-07 17:55:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15071 states to 15071 states and 37167 transitions. [2019-12-07 17:55:55,398 INFO L78 Accepts]: Start accepts. Automaton has 15071 states and 37167 transitions. Word has length 34 [2019-12-07 17:55:55,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:55,398 INFO L462 AbstractCegarLoop]: Abstraction has 15071 states and 37167 transitions. [2019-12-07 17:55:55,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:55,398 INFO L276 IsEmpty]: Start isEmpty. Operand 15071 states and 37167 transitions. [2019-12-07 17:55:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:55:55,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:55,408 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:55,408 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:55,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:55,408 INFO L82 PathProgramCache]: Analyzing trace with hash -108911515, now seen corresponding path program 1 times [2019-12-07 17:55:55,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:55,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621063349] [2019-12-07 17:55:55,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:55,448 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 17:55:55,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621063349] [2019-12-07 17:55:55,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:55,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:55:55,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282607558] [2019-12-07 17:55:55,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:55:55,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:55,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:55:55,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:55:55,450 INFO L87 Difference]: Start difference. First operand 15071 states and 37167 transitions. Second operand 5 states. [2019-12-07 17:55:55,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:55,484 INFO L93 Difference]: Finished difference Result 10068 states and 26310 transitions. [2019-12-07 17:55:55,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:55:55,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-07 17:55:55,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:55,493 INFO L225 Difference]: With dead ends: 10068 [2019-12-07 17:55:55,493 INFO L226 Difference]: Without dead ends: 10029 [2019-12-07 17:55:55,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:55:55,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10029 states. [2019-12-07 17:55:55,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10029 to 7393. [2019-12-07 17:55:55,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7393 states. [2019-12-07 17:55:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7393 states to 7393 states and 20368 transitions. [2019-12-07 17:55:55,602 INFO L78 Accepts]: Start accepts. Automaton has 7393 states and 20368 transitions. Word has length 36 [2019-12-07 17:55:55,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:55,603 INFO L462 AbstractCegarLoop]: Abstraction has 7393 states and 20368 transitions. [2019-12-07 17:55:55,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:55:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 7393 states and 20368 transitions. [2019-12-07 17:55:55,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:55:55,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:55,612 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:55,612 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:55,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1468892539, now seen corresponding path program 1 times [2019-12-07 17:55:55,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:55,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977306658] [2019-12-07 17:55:55,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:55,692 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 17:55:55,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977306658] [2019-12-07 17:55:55,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:55,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:55,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321022452] [2019-12-07 17:55:55,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:55:55,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:55,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:55:55,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:55:55,693 INFO L87 Difference]: Start difference. First operand 7393 states and 20368 transitions. Second operand 4 states. [2019-12-07 17:55:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:55,757 INFO L93 Difference]: Finished difference Result 10617 states and 27693 transitions. [2019-12-07 17:55:55,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:55:55,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 17:55:55,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:55,766 INFO L225 Difference]: With dead ends: 10617 [2019-12-07 17:55:55,766 INFO L226 Difference]: Without dead ends: 9604 [2019-12-07 17:55:55,767 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 17:55:55,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9604 states. [2019-12-07 17:55:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9604 to 6751. [2019-12-07 17:55:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6751 states. [2019-12-07 17:55:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6751 states to 6751 states and 18577 transitions. [2019-12-07 17:55:55,851 INFO L78 Accepts]: Start accepts. Automaton has 6751 states and 18577 transitions. Word has length 62 [2019-12-07 17:55:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:55,851 INFO L462 AbstractCegarLoop]: Abstraction has 6751 states and 18577 transitions. [2019-12-07 17:55:55,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:55:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 6751 states and 18577 transitions. [2019-12-07 17:55:55,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:55:55,859 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:55,859 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:55,859 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:55,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:55,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1486439051, now seen corresponding path program 2 times [2019-12-07 17:55:55,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:55,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763646475] [2019-12-07 17:55:55,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:55,941 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 17:55:55,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763646475] [2019-12-07 17:55:55,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:55,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:55:55,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363437504] [2019-12-07 17:55:55,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:55:55,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:55,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:55:55,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:55:55,942 INFO L87 Difference]: Start difference. First operand 6751 states and 18577 transitions. Second operand 4 states. [2019-12-07 17:55:56,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:56,124 INFO L93 Difference]: Finished difference Result 7339 states and 19863 transitions. [2019-12-07 17:55:56,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:55:56,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 17:55:56,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:56,132 INFO L225 Difference]: With dead ends: 7339 [2019-12-07 17:55:56,132 INFO L226 Difference]: Without dead ends: 7339 [2019-12-07 17:55:56,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:55:56,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7339 states. [2019-12-07 17:55:56,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7339 to 7127. [2019-12-07 17:55:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7127 states. [2019-12-07 17:55:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7127 states to 7127 states and 19325 transitions. [2019-12-07 17:55:56,214 INFO L78 Accepts]: Start accepts. Automaton has 7127 states and 19325 transitions. Word has length 62 [2019-12-07 17:55:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:56,214 INFO L462 AbstractCegarLoop]: Abstraction has 7127 states and 19325 transitions. [2019-12-07 17:55:56,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:55:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 7127 states and 19325 transitions. [2019-12-07 17:55:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:55:56,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:56,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:56,223 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:56,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:56,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1066134383, now seen corresponding path program 3 times [2019-12-07 17:55:56,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:56,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863806690] [2019-12-07 17:55:56,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:56,514 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 17:55:56,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863806690] [2019-12-07 17:55:56,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:56,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 17:55:56,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501525285] [2019-12-07 17:55:56,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:55:56,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:56,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:55:56,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:55:56,516 INFO L87 Difference]: Start difference. First operand 7127 states and 19325 transitions. Second operand 12 states. [2019-12-07 17:55:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:59,039 INFO L93 Difference]: Finished difference Result 20702 states and 51688 transitions. [2019-12-07 17:55:59,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 17:55:59,040 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-12-07 17:55:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:59,057 INFO L225 Difference]: With dead ends: 20702 [2019-12-07 17:55:59,057 INFO L226 Difference]: Without dead ends: 19958 [2019-12-07 17:55:59,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 17:55:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19958 states. [2019-12-07 17:55:59,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19958 to 10319. [2019-12-07 17:55:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10319 states. [2019-12-07 17:55:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10319 states to 10319 states and 27382 transitions. [2019-12-07 17:55:59,217 INFO L78 Accepts]: Start accepts. Automaton has 10319 states and 27382 transitions. Word has length 62 [2019-12-07 17:55:59,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:59,217 INFO L462 AbstractCegarLoop]: Abstraction has 10319 states and 27382 transitions. [2019-12-07 17:55:59,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:55:59,217 INFO L276 IsEmpty]: Start isEmpty. Operand 10319 states and 27382 transitions. [2019-12-07 17:55:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:55:59,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:59,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:59,228 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:59,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:59,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1844822754, now seen corresponding path program 1 times [2019-12-07 17:55:59,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:59,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077850534] [2019-12-07 17:55:59,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:59,448 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 17:55:59,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077850534] [2019-12-07 17:55:59,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:59,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:55:59,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632195307] [2019-12-07 17:55:59,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:55:59,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:59,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:55:59,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:55:59,449 INFO L87 Difference]: Start difference. First operand 10319 states and 27382 transitions. Second operand 10 states. [2019-12-07 17:56:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:00,644 INFO L93 Difference]: Finished difference Result 21580 states and 51917 transitions. [2019-12-07 17:56:00,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:56:00,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-12-07 17:56:00,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:00,663 INFO L225 Difference]: With dead ends: 21580 [2019-12-07 17:56:00,663 INFO L226 Difference]: Without dead ends: 20947 [2019-12-07 17:56:00,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:56:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20947 states. [2019-12-07 17:56:00,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20947 to 14643. [2019-12-07 17:56:00,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14643 states. [2019-12-07 17:56:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14643 states to 14643 states and 37283 transitions. [2019-12-07 17:56:00,855 INFO L78 Accepts]: Start accepts. Automaton has 14643 states and 37283 transitions. Word has length 63 [2019-12-07 17:56:00,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:00,855 INFO L462 AbstractCegarLoop]: Abstraction has 14643 states and 37283 transitions. [2019-12-07 17:56:00,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:56:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 14643 states and 37283 transitions. [2019-12-07 17:56:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:56:00,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:00,868 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:00,868 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:00,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:00,868 INFO L82 PathProgramCache]: Analyzing trace with hash 710760804, now seen corresponding path program 2 times [2019-12-07 17:56:00,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:00,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648358876] [2019-12-07 17:56:00,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:00,928 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 17:56:00,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648358876] [2019-12-07 17:56:00,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:00,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:00,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353628893] [2019-12-07 17:56:00,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:56:00,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:00,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:56:00,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:00,929 INFO L87 Difference]: Start difference. First operand 14643 states and 37283 transitions. Second operand 5 states. [2019-12-07 17:56:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:00,995 INFO L93 Difference]: Finished difference Result 18620 states and 45981 transitions. [2019-12-07 17:56:00,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:56:00,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 17:56:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:01,001 INFO L225 Difference]: With dead ends: 18620 [2019-12-07 17:56:01,001 INFO L226 Difference]: Without dead ends: 6395 [2019-12-07 17:56:01,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:56:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6395 states. [2019-12-07 17:56:01,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6395 to 5880. [2019-12-07 17:56:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5880 states. [2019-12-07 17:56:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5880 states to 5880 states and 13989 transitions. [2019-12-07 17:56:01,060 INFO L78 Accepts]: Start accepts. Automaton has 5880 states and 13989 transitions. Word has length 63 [2019-12-07 17:56:01,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:01,060 INFO L462 AbstractCegarLoop]: Abstraction has 5880 states and 13989 transitions. [2019-12-07 17:56:01,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:56:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 5880 states and 13989 transitions. [2019-12-07 17:56:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:56:01,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:01,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:01,064 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:01,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:01,064 INFO L82 PathProgramCache]: Analyzing trace with hash -942471944, now seen corresponding path program 3 times [2019-12-07 17:56:01,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:01,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541146879] [2019-12-07 17:56:01,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:01,120 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 17:56:01,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541146879] [2019-12-07 17:56:01,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:01,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:56:01,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268403906] [2019-12-07 17:56:01,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:01,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:01,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:01,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:01,121 INFO L87 Difference]: Start difference. First operand 5880 states and 13989 transitions. Second operand 4 states. [2019-12-07 17:56:01,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:01,149 INFO L93 Difference]: Finished difference Result 6346 states and 14961 transitions. [2019-12-07 17:56:01,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:01,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 17:56:01,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:01,150 INFO L225 Difference]: With dead ends: 6346 [2019-12-07 17:56:01,150 INFO L226 Difference]: Without dead ends: 562 [2019-12-07 17:56:01,150 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 17:56:01,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-12-07 17:56:01,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-12-07 17:56:01,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-12-07 17:56:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1154 transitions. [2019-12-07 17:56:01,154 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1154 transitions. Word has length 63 [2019-12-07 17:56:01,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:01,155 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 1154 transitions. [2019-12-07 17:56:01,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:01,155 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1154 transitions. [2019-12-07 17:56:01,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:56:01,155 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:01,155 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:01,155 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:01,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:01,155 INFO L82 PathProgramCache]: Analyzing trace with hash 424994232, now seen corresponding path program 4 times [2019-12-07 17:56:01,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:01,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23568898] [2019-12-07 17:56:01,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:01,227 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 17:56:01,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23568898] [2019-12-07 17:56:01,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:01,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:56:01,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079609895] [2019-12-07 17:56:01,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:56:01,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:01,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:56:01,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:56:01,229 INFO L87 Difference]: Start difference. First operand 562 states and 1154 transitions. Second operand 7 states. [2019-12-07 17:56:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:01,419 INFO L93 Difference]: Finished difference Result 1090 states and 2238 transitions. [2019-12-07 17:56:01,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:56:01,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-07 17:56:01,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:01,420 INFO L225 Difference]: With dead ends: 1090 [2019-12-07 17:56:01,420 INFO L226 Difference]: Without dead ends: 783 [2019-12-07 17:56:01,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:56:01,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-12-07 17:56:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 613. [2019-12-07 17:56:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-07 17:56:01,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1241 transitions. [2019-12-07 17:56:01,426 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1241 transitions. Word has length 63 [2019-12-07 17:56:01,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:01,426 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 1241 transitions. [2019-12-07 17:56:01,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:56:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1241 transitions. [2019-12-07 17:56:01,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:56:01,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:01,426 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:01,427 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:01,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:01,427 INFO L82 PathProgramCache]: Analyzing trace with hash 279364820, now seen corresponding path program 5 times [2019-12-07 17:56:01,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:01,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135907269] [2019-12-07 17:56:01,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:56:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:56:01,496 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:56:01,496 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:56:01,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= v_~y$r_buff0_thd0~0_148 0) (= v_~y$r_buff1_thd0~0_211 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$mem_tmp~0_192 0) (= 0 v_~y$r_buff0_thd3~0_503) (= v_~main$tmp_guard1~0_31 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd1~0_145 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= v_~x~0_69 0) (= v_~y$w_buff0_used~0_960 0) (= |v_ULTIMATE.start_main_~#t162~0.offset_18| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t162~0.base_25|) (= 0 v_~__unbuffered_p1_EAX~0_58) (= 0 v_~y$r_buff0_thd2~0_341) (= v_~y$w_buff1~0_320 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd1~0_76 0) (= 0 v_~y$r_buff1_thd2~0_299) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t162~0.base_25| 1)) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~y$flush_delayed~0_267 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~z~0_25 0) (= 0 v_~weak$$choice0~0_179) (= v_~y~0_332 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t162~0.base_25| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t162~0.base_25|)) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~y$w_buff0~0_491) (= v_~weak$$choice2~0_259 0) (= v_~y$w_buff1_used~0_583 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~y$r_buff1_thd3~0_336) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t162~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t162~0.base_25|) |v_ULTIMATE.start_main_~#t162~0.offset_18| 0)) |v_#memory_int_21|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_24|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t164~0.offset=|v_ULTIMATE.start_main_~#t164~0.offset_15|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_192, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_336, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_76, ~y$flush_delayed~0=v_~y$flush_delayed~0_267, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_68|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_56|, ~weak$$choice0~0=v_~weak$$choice0~0_179, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_144|, ~y$w_buff1~0=v_~y$w_buff1~0_320, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_211, ~x~0=v_~x~0_69, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_960, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_145, ~y$w_buff0~0=v_~y$w_buff0~0_491, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_503, ULTIMATE.start_main_~#t164~0.base=|v_ULTIMATE.start_main_~#t164~0.base_22|, ULTIMATE.start_main_~#t163~0.offset=|v_ULTIMATE.start_main_~#t163~0.offset_19|, ~y~0=v_~y~0_332, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_~#t162~0.base=|v_ULTIMATE.start_main_~#t162~0.base_25|, ULTIMATE.start_main_~#t162~0.offset=|v_ULTIMATE.start_main_~#t162~0.offset_18|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_108|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_299, ULTIMATE.start_main_~#t163~0.base=|v_ULTIMATE.start_main_~#t163~0.base_26|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_259, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ULTIMATE.start_main_~#t164~0.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t164~0.base, ULTIMATE.start_main_~#t163~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t162~0.base, ULTIMATE.start_main_~#t162~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t163~0.base, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:56:01,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L833-1-->L835: Formula: (and (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t163~0.base_13|)) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t163~0.base_13| 1) |v_#valid_34|) (= |v_ULTIMATE.start_main_~#t163~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t163~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t163~0.base_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t163~0.base_13| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t163~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t163~0.base_13|) |v_ULTIMATE.start_main_~#t163~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t163~0.base=|v_ULTIMATE.start_main_~#t163~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t163~0.offset=|v_ULTIMATE.start_main_~#t163~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t163~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t163~0.offset] because there is no mapped edge [2019-12-07 17:56:01,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t164~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t164~0.base_12| 4) |v_#length_15|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t164~0.base_12| 1)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t164~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t164~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t164~0.base_12|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t164~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t164~0.base_12|) |v_ULTIMATE.start_main_~#t164~0.offset_10| 2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t164~0.base=|v_ULTIMATE.start_main_~#t164~0.base_12|, #length=|v_#length_15|, ULTIMATE.start_main_~#t164~0.offset=|v_ULTIMATE.start_main_~#t164~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t164~0.base, #length, ULTIMATE.start_main_~#t164~0.offset] because there is no mapped edge [2019-12-07 17:56:01,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L4-->L795: Formula: (and (= v_~y~0_46 v_~y$mem_tmp~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet27_32| v_~weak$$choice2~0_67) (= v_~y$r_buff0_thd0~0_28 v_~y$r_buff1_thd0~0_28) (= 1 v_~y$r_buff0_thd3~0_110) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_17) (= |v_P2Thread1of1ForFork0_#t~nondet26_32| v_~weak$$choice0~0_28) (= v_~y$r_buff0_thd3~0_111 v_~y$r_buff1_thd3~0_58) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44)) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_43) (= v_~weak$$choice2~0_67 v_~y$flush_delayed~0_40)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_111, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_32|, ~y~0=v_~y~0_46, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_32|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44} OutVars{P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_31|, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_31|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_28, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_58, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_28} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet27, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 17:56:01,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1182280660 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1182280660 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out1182280660| ~y$w_buff1~0_In1182280660) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out1182280660| ~y$w_buff0~0_In1182280660) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1182280660, ~y$w_buff1~0=~y$w_buff1~0_In1182280660, ~y$w_buff0~0=~y$w_buff0~0_In1182280660, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1182280660} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1182280660|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1182280660, ~y$w_buff1~0=~y$w_buff1~0_In1182280660, ~y$w_buff0~0=~y$w_buff0~0_In1182280660, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1182280660} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 17:56:01,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L795-4-->L796: Formula: (= v_~y~0_60 |v_P2Thread1of1ForFork0_#t~ite28_10|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_10|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_9|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_60} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 17:56:01,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L800-->L801: Formula: (and (= v_~y$r_buff0_thd3~0_109 v_~y$r_buff0_thd3~0_108) (not (= (mod v_~weak$$choice2~0_66 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_66} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_108, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_6|, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 17:56:01,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-443459144 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-443459144| ~y$mem_tmp~0_In-443459144) (not .cse0)) (and .cse0 (= ~y~0_In-443459144 |P2Thread1of1ForFork0_#t~ite48_Out-443459144|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-443459144, ~y$flush_delayed~0=~y$flush_delayed~0_In-443459144, ~y~0=~y~0_In-443459144} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-443459144|, ~y$mem_tmp~0=~y$mem_tmp~0_In-443459144, ~y$flush_delayed~0=~y$flush_delayed~0_In-443459144, ~y~0=~y~0_In-443459144} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 17:56:01,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= v_~z~0_12 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_40 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_40, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 17:56:01,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1344740600 256)))) (or (and (= ~y~0_In-1344740600 |P1Thread1of1ForFork2_#t~ite25_Out-1344740600|) .cse0) (and (= ~y$mem_tmp~0_In-1344740600 |P1Thread1of1ForFork2_#t~ite25_Out-1344740600|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1344740600, ~y$flush_delayed~0=~y$flush_delayed~0_In-1344740600, ~y~0=~y~0_In-1344740600} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1344740600, ~y$flush_delayed~0=~y$flush_delayed~0_In-1344740600, ~y~0=~y~0_In-1344740600, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1344740600|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:56:01,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y$flush_delayed~0_118 0) (= v_~y~0_147 |v_P1Thread1of1ForFork2_#t~ite25_66|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_66|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_118, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~y~0=v_~y~0_147, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_65|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:56:01,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1447649185 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1447649185 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1447649185|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1447649185 |P2Thread1of1ForFork0_#t~ite51_Out1447649185|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1447649185, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1447649185} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1447649185, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1447649185, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1447649185|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 17:56:01,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1835832860 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1835832860 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1835832860 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1835832860 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out1835832860| ~y$w_buff1_used~0_In1835832860) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out1835832860| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1835832860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1835832860, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1835832860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1835832860} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1835832860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1835832860, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1835832860, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1835832860|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1835832860} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 17:56:01,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L814: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_Out-738514053 ~y$r_buff0_thd3~0_In-738514053)) (.cse2 (= (mod ~y$w_buff0_used~0_In-738514053 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-738514053 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (not .cse1) (= ~y$r_buff0_thd3~0_Out-738514053 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-738514053, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-738514053} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-738514053, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-738514053, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-738514053|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 17:56:01,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In831583246 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In831583246 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In831583246 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In831583246 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out831583246| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite54_Out831583246| ~y$r_buff1_thd3~0_In831583246) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In831583246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In831583246, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In831583246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In831583246} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In831583246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In831583246, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out831583246|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In831583246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In831583246} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 17:56:01,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L814-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~y$r_buff1_thd3~0_276 |v_P2Thread1of1ForFork0_#t~ite54_34|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_276, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 17:56:01,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L837-1-->L843: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:56:01,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L843-2-->L843-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite59_Out167082366| |ULTIMATE.start_main_#t~ite58_Out167082366|)) (.cse2 (= (mod ~y$w_buff1_used~0_In167082366 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In167082366 256) 0))) (or (and (= ~y$w_buff1~0_In167082366 |ULTIMATE.start_main_#t~ite58_Out167082366|) (not .cse0) .cse1 (not .cse2)) (and .cse1 (= ~y~0_In167082366 |ULTIMATE.start_main_#t~ite58_Out167082366|) (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In167082366, ~y~0=~y~0_In167082366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In167082366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In167082366} OutVars{~y$w_buff1~0=~y$w_buff1~0_In167082366, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out167082366|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out167082366|, ~y~0=~y~0_In167082366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In167082366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In167082366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:56:01,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-990102393 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-990102393 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-990102393|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-990102393 |ULTIMATE.start_main_#t~ite60_Out-990102393|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-990102393, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-990102393} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-990102393|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-990102393, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-990102393} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 17:56:01,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1975282977 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1975282977 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1975282977 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1975282977 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1975282977|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1975282977 |ULTIMATE.start_main_#t~ite61_Out-1975282977|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1975282977, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1975282977, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1975282977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1975282977} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1975282977|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1975282977, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1975282977, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1975282977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1975282977} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:56:01,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In445612598 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In445612598 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out445612598| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out445612598| ~y$r_buff0_thd0~0_In445612598)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In445612598, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In445612598} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out445612598|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In445612598, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In445612598} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:56:01,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-101907614 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-101907614 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-101907614 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-101907614 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-101907614|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-101907614 |ULTIMATE.start_main_#t~ite63_Out-101907614|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-101907614, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-101907614, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-101907614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-101907614} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-101907614|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-101907614, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-101907614, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-101907614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-101907614} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:56:01,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$r_buff1_thd0~0_206 |v_ULTIMATE.start_main_#t~ite63_48|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_25 (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_53) (= v_~x~0_64 2) (= v_~__unbuffered_p2_EBX~0_28 0) (= 1 v_~__unbuffered_p2_EAX~0_42) (= v_~__unbuffered_p1_EBX~0_35 0))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_48|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_206, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:56:01,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:56:01 BasicIcfg [2019-12-07 17:56:01,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:56:01,574 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:56:01,574 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:56:01,574 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:56:01,574 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:55:21" (3/4) ... [2019-12-07 17:56:01,576 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:56:01,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= v_~y$r_buff0_thd0~0_148 0) (= v_~y$r_buff1_thd0~0_211 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$mem_tmp~0_192 0) (= 0 v_~y$r_buff0_thd3~0_503) (= v_~main$tmp_guard1~0_31 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd1~0_145 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= v_~x~0_69 0) (= v_~y$w_buff0_used~0_960 0) (= |v_ULTIMATE.start_main_~#t162~0.offset_18| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t162~0.base_25|) (= 0 v_~__unbuffered_p1_EAX~0_58) (= 0 v_~y$r_buff0_thd2~0_341) (= v_~y$w_buff1~0_320 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd1~0_76 0) (= 0 v_~y$r_buff1_thd2~0_299) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t162~0.base_25| 1)) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~y$flush_delayed~0_267 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~z~0_25 0) (= 0 v_~weak$$choice0~0_179) (= v_~y~0_332 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t162~0.base_25| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t162~0.base_25|)) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~y$w_buff0~0_491) (= v_~weak$$choice2~0_259 0) (= v_~y$w_buff1_used~0_583 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~y$r_buff1_thd3~0_336) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t162~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t162~0.base_25|) |v_ULTIMATE.start_main_~#t162~0.offset_18| 0)) |v_#memory_int_21|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_24|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t164~0.offset=|v_ULTIMATE.start_main_~#t164~0.offset_15|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_192, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_336, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_76, ~y$flush_delayed~0=v_~y$flush_delayed~0_267, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_68|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_56|, ~weak$$choice0~0=v_~weak$$choice0~0_179, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_144|, ~y$w_buff1~0=v_~y$w_buff1~0_320, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_211, ~x~0=v_~x~0_69, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_960, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_145, ~y$w_buff0~0=v_~y$w_buff0~0_491, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_503, ULTIMATE.start_main_~#t164~0.base=|v_ULTIMATE.start_main_~#t164~0.base_22|, ULTIMATE.start_main_~#t163~0.offset=|v_ULTIMATE.start_main_~#t163~0.offset_19|, ~y~0=v_~y~0_332, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_~#t162~0.base=|v_ULTIMATE.start_main_~#t162~0.base_25|, ULTIMATE.start_main_~#t162~0.offset=|v_ULTIMATE.start_main_~#t162~0.offset_18|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_108|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_299, ULTIMATE.start_main_~#t163~0.base=|v_ULTIMATE.start_main_~#t163~0.base_26|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_259, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ULTIMATE.start_main_~#t164~0.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t164~0.base, ULTIMATE.start_main_~#t163~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t162~0.base, ULTIMATE.start_main_~#t162~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t163~0.base, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:56:01,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L833-1-->L835: Formula: (and (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t163~0.base_13|)) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t163~0.base_13| 1) |v_#valid_34|) (= |v_ULTIMATE.start_main_~#t163~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t163~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t163~0.base_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t163~0.base_13| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t163~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t163~0.base_13|) |v_ULTIMATE.start_main_~#t163~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t163~0.base=|v_ULTIMATE.start_main_~#t163~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t163~0.offset=|v_ULTIMATE.start_main_~#t163~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t163~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t163~0.offset] because there is no mapped edge [2019-12-07 17:56:01,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t164~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t164~0.base_12| 4) |v_#length_15|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t164~0.base_12| 1)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t164~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t164~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t164~0.base_12|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t164~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t164~0.base_12|) |v_ULTIMATE.start_main_~#t164~0.offset_10| 2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t164~0.base=|v_ULTIMATE.start_main_~#t164~0.base_12|, #length=|v_#length_15|, ULTIMATE.start_main_~#t164~0.offset=|v_ULTIMATE.start_main_~#t164~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t164~0.base, #length, ULTIMATE.start_main_~#t164~0.offset] because there is no mapped edge [2019-12-07 17:56:01,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L4-->L795: Formula: (and (= v_~y~0_46 v_~y$mem_tmp~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet27_32| v_~weak$$choice2~0_67) (= v_~y$r_buff0_thd0~0_28 v_~y$r_buff1_thd0~0_28) (= 1 v_~y$r_buff0_thd3~0_110) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_17) (= |v_P2Thread1of1ForFork0_#t~nondet26_32| v_~weak$$choice0~0_28) (= v_~y$r_buff0_thd3~0_111 v_~y$r_buff1_thd3~0_58) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44)) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_43) (= v_~weak$$choice2~0_67 v_~y$flush_delayed~0_40)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_111, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_32|, ~y~0=v_~y~0_46, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_32|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44} OutVars{P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_31|, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_31|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_28, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_58, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_28} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet27, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 17:56:01,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1182280660 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1182280660 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out1182280660| ~y$w_buff1~0_In1182280660) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out1182280660| ~y$w_buff0~0_In1182280660) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1182280660, ~y$w_buff1~0=~y$w_buff1~0_In1182280660, ~y$w_buff0~0=~y$w_buff0~0_In1182280660, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1182280660} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1182280660|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1182280660, ~y$w_buff1~0=~y$w_buff1~0_In1182280660, ~y$w_buff0~0=~y$w_buff0~0_In1182280660, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1182280660} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 17:56:01,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L795-4-->L796: Formula: (= v_~y~0_60 |v_P2Thread1of1ForFork0_#t~ite28_10|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_10|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_9|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_60} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 17:56:01,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L800-->L801: Formula: (and (= v_~y$r_buff0_thd3~0_109 v_~y$r_buff0_thd3~0_108) (not (= (mod v_~weak$$choice2~0_66 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_66} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_108, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_6|, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 17:56:01,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-443459144 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-443459144| ~y$mem_tmp~0_In-443459144) (not .cse0)) (and .cse0 (= ~y~0_In-443459144 |P2Thread1of1ForFork0_#t~ite48_Out-443459144|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-443459144, ~y$flush_delayed~0=~y$flush_delayed~0_In-443459144, ~y~0=~y~0_In-443459144} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-443459144|, ~y$mem_tmp~0=~y$mem_tmp~0_In-443459144, ~y$flush_delayed~0=~y$flush_delayed~0_In-443459144, ~y~0=~y~0_In-443459144} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 17:56:01,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= v_~z~0_12 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_40 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_40, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 17:56:01,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1344740600 256)))) (or (and (= ~y~0_In-1344740600 |P1Thread1of1ForFork2_#t~ite25_Out-1344740600|) .cse0) (and (= ~y$mem_tmp~0_In-1344740600 |P1Thread1of1ForFork2_#t~ite25_Out-1344740600|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1344740600, ~y$flush_delayed~0=~y$flush_delayed~0_In-1344740600, ~y~0=~y~0_In-1344740600} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1344740600, ~y$flush_delayed~0=~y$flush_delayed~0_In-1344740600, ~y~0=~y~0_In-1344740600, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1344740600|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:56:01,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y$flush_delayed~0_118 0) (= v_~y~0_147 |v_P1Thread1of1ForFork2_#t~ite25_66|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_66|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_118, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~y~0=v_~y~0_147, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_65|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:56:01,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1447649185 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1447649185 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1447649185|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1447649185 |P2Thread1of1ForFork0_#t~ite51_Out1447649185|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1447649185, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1447649185} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1447649185, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1447649185, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1447649185|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 17:56:01,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1835832860 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1835832860 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1835832860 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1835832860 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out1835832860| ~y$w_buff1_used~0_In1835832860) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out1835832860| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1835832860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1835832860, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1835832860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1835832860} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1835832860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1835832860, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1835832860, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1835832860|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1835832860} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 17:56:01,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L814: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_Out-738514053 ~y$r_buff0_thd3~0_In-738514053)) (.cse2 (= (mod ~y$w_buff0_used~0_In-738514053 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-738514053 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (not .cse1) (= ~y$r_buff0_thd3~0_Out-738514053 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-738514053, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-738514053} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-738514053, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-738514053, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-738514053|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 17:56:01,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In831583246 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In831583246 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In831583246 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In831583246 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out831583246| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite54_Out831583246| ~y$r_buff1_thd3~0_In831583246) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In831583246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In831583246, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In831583246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In831583246} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In831583246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In831583246, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out831583246|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In831583246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In831583246} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 17:56:01,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L814-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~y$r_buff1_thd3~0_276 |v_P2Thread1of1ForFork0_#t~ite54_34|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_276, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 17:56:01,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L837-1-->L843: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:56:01,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L843-2-->L843-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite59_Out167082366| |ULTIMATE.start_main_#t~ite58_Out167082366|)) (.cse2 (= (mod ~y$w_buff1_used~0_In167082366 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In167082366 256) 0))) (or (and (= ~y$w_buff1~0_In167082366 |ULTIMATE.start_main_#t~ite58_Out167082366|) (not .cse0) .cse1 (not .cse2)) (and .cse1 (= ~y~0_In167082366 |ULTIMATE.start_main_#t~ite58_Out167082366|) (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In167082366, ~y~0=~y~0_In167082366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In167082366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In167082366} OutVars{~y$w_buff1~0=~y$w_buff1~0_In167082366, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out167082366|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out167082366|, ~y~0=~y~0_In167082366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In167082366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In167082366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:56:01,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-990102393 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-990102393 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-990102393|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-990102393 |ULTIMATE.start_main_#t~ite60_Out-990102393|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-990102393, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-990102393} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-990102393|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-990102393, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-990102393} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 17:56:01,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1975282977 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1975282977 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1975282977 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1975282977 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1975282977|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1975282977 |ULTIMATE.start_main_#t~ite61_Out-1975282977|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1975282977, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1975282977, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1975282977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1975282977} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1975282977|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1975282977, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1975282977, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1975282977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1975282977} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:56:01,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In445612598 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In445612598 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out445612598| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out445612598| ~y$r_buff0_thd0~0_In445612598)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In445612598, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In445612598} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out445612598|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In445612598, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In445612598} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:56:01,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-101907614 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-101907614 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-101907614 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-101907614 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-101907614|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-101907614 |ULTIMATE.start_main_#t~ite63_Out-101907614|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-101907614, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-101907614, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-101907614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-101907614} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-101907614|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-101907614, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-101907614, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-101907614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-101907614} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:56:01,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$r_buff1_thd0~0_206 |v_ULTIMATE.start_main_#t~ite63_48|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_25 (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_53) (= v_~x~0_64 2) (= v_~__unbuffered_p2_EBX~0_28 0) (= 1 v_~__unbuffered_p2_EAX~0_42) (= v_~__unbuffered_p1_EBX~0_35 0))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_48|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_206, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:56:01,649 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a7cd95c1-3715-47ac-90cf-7134d8c98ae1/bin/uautomizer/witness.graphml [2019-12-07 17:56:01,650 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:56:01,651 INFO L168 Benchmark]: Toolchain (without parser) took 41113.50 ms. Allocated memory was 1.0 GB in the beginning and 5.7 GB in the end (delta: 4.6 GB). Free memory was 940.7 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-12-07 17:56:01,651 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:56:01,651 INFO L168 Benchmark]: CACSL2BoogieTranslator took 432.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -125.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:56:01,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:56:01,652 INFO L168 Benchmark]: Boogie Preprocessor took 27.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:56:01,652 INFO L168 Benchmark]: RCFGBuilder took 454.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.5 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:56:01,652 INFO L168 Benchmark]: TraceAbstraction took 40078.76 ms. Allocated memory was 1.1 GB in the beginning and 5.7 GB in the end (delta: 4.5 GB). Free memory was 998.5 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-12-07 17:56:01,652 INFO L168 Benchmark]: Witness Printer took 75.70 ms. Allocated memory is still 5.7 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:56:01,654 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 432.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -125.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 454.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.5 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40078.76 ms. Allocated memory was 1.1 GB in the beginning and 5.7 GB in the end (delta: 4.5 GB). Free memory was 998.5 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 75.70 ms. Allocated memory is still 5.7 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 195 ProgramPointsBefore, 110 ProgramPointsAfterwards, 241 TransitionsBefore, 133 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 27 ChoiceCompositions, 9977 VarBasedMoverChecksPositive, 318 VarBasedMoverChecksNegative, 79 SemBasedMoverChecksPositive, 323 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 128241 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t162, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t163, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t164, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L795] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L797] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L798] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y = y$flush_delayed ? y$mem_tmp : y [L804] 3 y$flush_delayed = (_Bool)0 [L807] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 2 x = 2 [L751] 2 __unbuffered_p1_EAX = x [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L764] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L844] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L845] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L846] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 186 locations, 2 error locations. Result: UNSAFE, OverallTime: 39.9s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4629 SDtfs, 4507 SDslu, 10618 SDs, 0 SdLazy, 5824 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115674occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 76866 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 667 ConstructedInterpolants, 0 QuantifiedInterpolants, 244608 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...