./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_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_c2331947-ddbc-4e5f-8bf1-5e2b2986f00a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c2331947-ddbc-4e5f-8bf1-5e2b2986f00a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c2331947-ddbc-4e5f-8bf1-5e2b2986f00a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c2331947-ddbc-4e5f-8bf1-5e2b2986f00a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c2331947-ddbc-4e5f-8bf1-5e2b2986f00a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c2331947-ddbc-4e5f-8bf1-5e2b2986f00a/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 0cb8101eae418e168c11939e6cf99d85a4c6621d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:42:19,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:42:19,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:42:19,768 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:42:19,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:42:19,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:42:19,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:42:19,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:42:19,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:42:19,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:42:19,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:42:19,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:42:19,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:42:19,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:42:19,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:42:19,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:42:19,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:42:19,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:42:19,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:42:19,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:42:19,782 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:42:19,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:42:19,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:42:19,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:42:19,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:42:19,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:42:19,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:42:19,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:42:19,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:42:19,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:42:19,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:42:19,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:42:19,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:42:19,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:42:19,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:42:19,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:42:19,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:42:19,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:42:19,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:42:19,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:42:19,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:42:19,791 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c2331947-ddbc-4e5f-8bf1-5e2b2986f00a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:42:19,800 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:42:19,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:42:19,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:42:19,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:42:19,802 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:42:19,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:42:19,802 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:42:19,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:42:19,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:42:19,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:42:19,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:42:19,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:42:19,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:42:19,802 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:42:19,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:42:19,803 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:42:19,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:42:19,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:42:19,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:42:19,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:42:19,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:42:19,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:42:19,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:42:19,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:42:19,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:42:19,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:42:19,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:42:19,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:42:19,804 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:42:19,804 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_c2331947-ddbc-4e5f-8bf1-5e2b2986f00a/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 -> 0cb8101eae418e168c11939e6cf99d85a4c6621d [2019-12-07 10:42:19,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:42:19,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:42:19,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:42:19,912 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:42:19,913 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:42:19,913 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c2331947-ddbc-4e5f-8bf1-5e2b2986f00a/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi008_pso.opt.i [2019-12-07 10:42:19,950 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2331947-ddbc-4e5f-8bf1-5e2b2986f00a/bin/uautomizer/data/856023c22/873ba61748764085a09ecabb07435e57/FLAG78560fe5a [2019-12-07 10:42:20,434 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:42:20,435 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c2331947-ddbc-4e5f-8bf1-5e2b2986f00a/sv-benchmarks/c/pthread-wmm/rfi008_pso.opt.i [2019-12-07 10:42:20,446 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2331947-ddbc-4e5f-8bf1-5e2b2986f00a/bin/uautomizer/data/856023c22/873ba61748764085a09ecabb07435e57/FLAG78560fe5a [2019-12-07 10:42:20,455 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c2331947-ddbc-4e5f-8bf1-5e2b2986f00a/bin/uautomizer/data/856023c22/873ba61748764085a09ecabb07435e57 [2019-12-07 10:42:20,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:42:20,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:42:20,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:42:20,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:42:20,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:42:20,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:42:20" (1/1) ... [2019-12-07 10:42:20,463 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 10:42:20, skipping insertion in model container [2019-12-07 10:42:20,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:42:20" (1/1) ... [2019-12-07 10:42:20,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:42:20,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:42:20,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:42:20,748 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:42:20,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:42:20,834 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:42:20,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:20 WrapperNode [2019-12-07 10:42:20,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:42:20,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:42:20,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:42:20,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:42:20,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:20" (1/1) ... [2019-12-07 10:42:20,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:20" (1/1) ... [2019-12-07 10:42:20,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:42:20,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:42:20,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:42:20,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:42:20,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:20" (1/1) ... [2019-12-07 10:42:20,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:20" (1/1) ... [2019-12-07 10:42:20,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:20" (1/1) ... [2019-12-07 10:42:20,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:20" (1/1) ... [2019-12-07 10:42:20,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:20" (1/1) ... [2019-12-07 10:42:20,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:20" (1/1) ... [2019-12-07 10:42:20,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:20" (1/1) ... [2019-12-07 10:42:20,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:42:20,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:42:20,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:42:20,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:42:20,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2331947-ddbc-4e5f-8bf1-5e2b2986f00a/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 10:42:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:42:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:42:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:42:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:42:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:42:20,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:42:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:42:20,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:42:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:42:20,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:42:20,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:42:20,952 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 10:42:21,334 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:42:21,334 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:42:21,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:42:21 BoogieIcfgContainer [2019-12-07 10:42:21,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:42:21,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:42:21,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:42:21,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:42:21,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:42:20" (1/3) ... [2019-12-07 10:42:21,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce15e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:42:21, skipping insertion in model container [2019-12-07 10:42:21,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:20" (2/3) ... [2019-12-07 10:42:21,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce15e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:42:21, skipping insertion in model container [2019-12-07 10:42:21,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:42:21" (3/3) ... [2019-12-07 10:42:21,340 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_pso.opt.i [2019-12-07 10:42:21,346 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:42:21,346 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:42:21,351 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:42:21,352 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:42:21,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,378 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,378 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,390 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,390 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,391 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,392 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,393 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:21,416 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 10:42:21,428 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:42:21,428 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:42:21,428 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:42:21,429 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:42:21,429 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:42:21,429 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:42:21,429 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:42:21,429 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:42:21,440 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-07 10:42:21,441 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-07 10:42:21,499 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-07 10:42:21,499 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:42:21,512 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 920 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 10:42:21,532 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-07 10:42:21,566 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-07 10:42:21,566 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:42:21,572 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 920 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 10:42:21,592 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-07 10:42:21,592 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:42:24,300 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 10:42:24,460 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 10:42:24,569 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125257 [2019-12-07 10:42:24,569 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 10:42:24,571 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 129 transitions [2019-12-07 10:42:25,817 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25272 states. [2019-12-07 10:42:25,819 INFO L276 IsEmpty]: Start isEmpty. Operand 25272 states. [2019-12-07 10:42:25,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 10:42:25,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:25,823 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 10:42:25,823 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:25,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:25,827 INFO L82 PathProgramCache]: Analyzing trace with hash 961433507, now seen corresponding path program 1 times [2019-12-07 10:42:25,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:25,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522320417] [2019-12-07 10:42:25,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:25,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522320417] [2019-12-07 10:42:25,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:25,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:42:25,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796574262] [2019-12-07 10:42:25,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:42:25,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:25,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:42:25,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:42:25,980 INFO L87 Difference]: Start difference. First operand 25272 states. Second operand 3 states. [2019-12-07 10:42:26,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:26,270 INFO L93 Difference]: Finished difference Result 25080 states and 89817 transitions. [2019-12-07 10:42:26,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:42:26,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 10:42:26,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:26,425 INFO L225 Difference]: With dead ends: 25080 [2019-12-07 10:42:26,425 INFO L226 Difference]: Without dead ends: 23470 [2019-12-07 10:42:26,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:42:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23470 states. [2019-12-07 10:42:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23470 to 23470. [2019-12-07 10:42:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23470 states. [2019-12-07 10:42:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23470 states to 23470 states and 83991 transitions. [2019-12-07 10:42:27,306 INFO L78 Accepts]: Start accepts. Automaton has 23470 states and 83991 transitions. Word has length 5 [2019-12-07 10:42:27,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:27,307 INFO L462 AbstractCegarLoop]: Abstraction has 23470 states and 83991 transitions. [2019-12-07 10:42:27,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:42:27,307 INFO L276 IsEmpty]: Start isEmpty. Operand 23470 states and 83991 transitions. [2019-12-07 10:42:27,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:42:27,309 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:27,309 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:27,310 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:27,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:27,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1303916439, now seen corresponding path program 1 times [2019-12-07 10:42:27,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:27,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370905386] [2019-12-07 10:42:27,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:27,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370905386] [2019-12-07 10:42:27,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:27,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:42:27,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387398943] [2019-12-07 10:42:27,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:42:27,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:27,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:42:27,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:42:27,371 INFO L87 Difference]: Start difference. First operand 23470 states and 83991 transitions. Second operand 4 states. [2019-12-07 10:42:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:27,789 INFO L93 Difference]: Finished difference Result 36446 states and 124910 transitions. [2019-12-07 10:42:27,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:42:27,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:42:27,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:27,925 INFO L225 Difference]: With dead ends: 36446 [2019-12-07 10:42:27,925 INFO L226 Difference]: Without dead ends: 36430 [2019-12-07 10:42:27,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:42:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36430 states. [2019-12-07 10:42:28,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36430 to 35607. [2019-12-07 10:42:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35607 states. [2019-12-07 10:42:28,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35607 states to 35607 states and 122732 transitions. [2019-12-07 10:42:28,911 INFO L78 Accepts]: Start accepts. Automaton has 35607 states and 122732 transitions. Word has length 11 [2019-12-07 10:42:28,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:28,911 INFO L462 AbstractCegarLoop]: Abstraction has 35607 states and 122732 transitions. [2019-12-07 10:42:28,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:42:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 35607 states and 122732 transitions. [2019-12-07 10:42:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:42:28,915 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:28,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:28,915 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:28,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:28,915 INFO L82 PathProgramCache]: Analyzing trace with hash -273660052, now seen corresponding path program 1 times [2019-12-07 10:42:28,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:28,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935729212] [2019-12-07 10:42:28,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:28,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:28,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935729212] [2019-12-07 10:42:28,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:28,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:42:28,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688227826] [2019-12-07 10:42:28,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:42:28,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:28,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:42:28,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:42:28,960 INFO L87 Difference]: Start difference. First operand 35607 states and 122732 transitions. Second operand 4 states. [2019-12-07 10:42:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:29,258 INFO L93 Difference]: Finished difference Result 46394 states and 157073 transitions. [2019-12-07 10:42:29,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:42:29,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 10:42:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:29,334 INFO L225 Difference]: With dead ends: 46394 [2019-12-07 10:42:29,334 INFO L226 Difference]: Without dead ends: 46379 [2019-12-07 10:42:29,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:42:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46379 states. [2019-12-07 10:42:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46379 to 41501. [2019-12-07 10:42:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41501 states. [2019-12-07 10:42:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41501 states to 41501 states and 142005 transitions. [2019-12-07 10:42:30,342 INFO L78 Accepts]: Start accepts. Automaton has 41501 states and 142005 transitions. Word has length 14 [2019-12-07 10:42:30,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:30,342 INFO L462 AbstractCegarLoop]: Abstraction has 41501 states and 142005 transitions. [2019-12-07 10:42:30,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:42:30,343 INFO L276 IsEmpty]: Start isEmpty. Operand 41501 states and 142005 transitions. [2019-12-07 10:42:30,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:42:30,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:30,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:30,345 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:30,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:30,346 INFO L82 PathProgramCache]: Analyzing trace with hash 106501689, now seen corresponding path program 1 times [2019-12-07 10:42:30,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:30,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791875168] [2019-12-07 10:42:30,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:30,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791875168] [2019-12-07 10:42:30,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:30,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:42:30,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133716023] [2019-12-07 10:42:30,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:42:30,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:30,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:42:30,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:42:30,374 INFO L87 Difference]: Start difference. First operand 41501 states and 142005 transitions. Second operand 3 states. [2019-12-07 10:42:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:30,627 INFO L93 Difference]: Finished difference Result 67890 states and 222025 transitions. [2019-12-07 10:42:30,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:42:30,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 10:42:30,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:30,740 INFO L225 Difference]: With dead ends: 67890 [2019-12-07 10:42:30,740 INFO L226 Difference]: Without dead ends: 67890 [2019-12-07 10:42:30,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:42:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67890 states. [2019-12-07 10:42:31,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67890 to 60518. [2019-12-07 10:42:31,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60518 states. [2019-12-07 10:42:32,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60518 states to 60518 states and 201033 transitions. [2019-12-07 10:42:32,239 INFO L78 Accepts]: Start accepts. Automaton has 60518 states and 201033 transitions. Word has length 15 [2019-12-07 10:42:32,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:32,240 INFO L462 AbstractCegarLoop]: Abstraction has 60518 states and 201033 transitions. [2019-12-07 10:42:32,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:42:32,240 INFO L276 IsEmpty]: Start isEmpty. Operand 60518 states and 201033 transitions. [2019-12-07 10:42:32,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:42:32,244 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:32,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:32,245 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:32,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:32,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1396090736, now seen corresponding path program 1 times [2019-12-07 10:42:32,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:32,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144119676] [2019-12-07 10:42:32,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:32,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144119676] [2019-12-07 10:42:32,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:32,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:42:32,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698681527] [2019-12-07 10:42:32,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:42:32,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:32,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:42:32,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:42:32,305 INFO L87 Difference]: Start difference. First operand 60518 states and 201033 transitions. Second operand 4 states. [2019-12-07 10:42:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:32,348 INFO L93 Difference]: Finished difference Result 9507 states and 25746 transitions. [2019-12-07 10:42:32,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:42:32,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:42:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:32,354 INFO L225 Difference]: With dead ends: 9507 [2019-12-07 10:42:32,354 INFO L226 Difference]: Without dead ends: 5931 [2019-12-07 10:42:32,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:42:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5931 states. [2019-12-07 10:42:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5931 to 5931. [2019-12-07 10:42:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5931 states. [2019-12-07 10:42:32,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5931 states to 5931 states and 13936 transitions. [2019-12-07 10:42:32,407 INFO L78 Accepts]: Start accepts. Automaton has 5931 states and 13936 transitions. Word has length 16 [2019-12-07 10:42:32,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:32,407 INFO L462 AbstractCegarLoop]: Abstraction has 5931 states and 13936 transitions. [2019-12-07 10:42:32,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:42:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 5931 states and 13936 transitions. [2019-12-07 10:42:32,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:42:32,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:32,409 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 10:42:32,409 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:32,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:32,409 INFO L82 PathProgramCache]: Analyzing trace with hash -717781961, now seen corresponding path program 1 times [2019-12-07 10:42:32,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:32,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234950442] [2019-12-07 10:42:32,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:32,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234950442] [2019-12-07 10:42:32,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:32,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:42:32,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306390017] [2019-12-07 10:42:32,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:42:32,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:32,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:42:32,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:42:32,451 INFO L87 Difference]: Start difference. First operand 5931 states and 13936 transitions. Second operand 4 states. [2019-12-07 10:42:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:32,609 INFO L93 Difference]: Finished difference Result 7446 states and 17184 transitions. [2019-12-07 10:42:32,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:42:32,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 10:42:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:32,616 INFO L225 Difference]: With dead ends: 7446 [2019-12-07 10:42:32,616 INFO L226 Difference]: Without dead ends: 7418 [2019-12-07 10:42:32,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:42:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7418 states. [2019-12-07 10:42:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7418 to 5909. [2019-12-07 10:42:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5909 states. [2019-12-07 10:42:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5909 states to 5909 states and 13876 transitions. [2019-12-07 10:42:32,675 INFO L78 Accepts]: Start accepts. Automaton has 5909 states and 13876 transitions. Word has length 17 [2019-12-07 10:42:32,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:32,675 INFO L462 AbstractCegarLoop]: Abstraction has 5909 states and 13876 transitions. [2019-12-07 10:42:32,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:42:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 5909 states and 13876 transitions. [2019-12-07 10:42:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:42:32,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:32,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:32,679 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:32,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:32,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2019815131, now seen corresponding path program 1 times [2019-12-07 10:42:32,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:32,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516240253] [2019-12-07 10:42:32,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:32,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516240253] [2019-12-07 10:42:32,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:32,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:42:32,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096813920] [2019-12-07 10:42:32,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:42:32,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:32,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:42:32,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:42:32,720 INFO L87 Difference]: Start difference. First operand 5909 states and 13876 transitions. Second operand 5 states. [2019-12-07 10:42:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:32,949 INFO L93 Difference]: Finished difference Result 8033 states and 18356 transitions. [2019-12-07 10:42:32,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:42:32,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 10:42:32,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:32,956 INFO L225 Difference]: With dead ends: 8033 [2019-12-07 10:42:32,956 INFO L226 Difference]: Without dead ends: 8032 [2019-12-07 10:42:32,956 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 10:42:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8032 states. [2019-12-07 10:42:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8032 to 7392. [2019-12-07 10:42:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7392 states. [2019-12-07 10:42:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7392 states to 7392 states and 17086 transitions. [2019-12-07 10:42:33,028 INFO L78 Accepts]: Start accepts. Automaton has 7392 states and 17086 transitions. Word has length 28 [2019-12-07 10:42:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:33,028 INFO L462 AbstractCegarLoop]: Abstraction has 7392 states and 17086 transitions. [2019-12-07 10:42:33,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:42:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 7392 states and 17086 transitions. [2019-12-07 10:42:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:42:33,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:33,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:33,033 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:33,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1401908326, now seen corresponding path program 1 times [2019-12-07 10:42:33,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:33,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636136290] [2019-12-07 10:42:33,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:33,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636136290] [2019-12-07 10:42:33,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:33,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:42:33,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422752604] [2019-12-07 10:42:33,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:42:33,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:33,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:42:33,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:42:33,064 INFO L87 Difference]: Start difference. First operand 7392 states and 17086 transitions. Second operand 3 states. [2019-12-07 10:42:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:33,111 INFO L93 Difference]: Finished difference Result 7931 states and 17358 transitions. [2019-12-07 10:42:33,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:42:33,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 10:42:33,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:33,117 INFO L225 Difference]: With dead ends: 7931 [2019-12-07 10:42:33,118 INFO L226 Difference]: Without dead ends: 7931 [2019-12-07 10:42:33,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:42:33,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2019-12-07 10:42:33,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 7375. [2019-12-07 10:42:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7375 states. [2019-12-07 10:42:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7375 states to 7375 states and 16200 transitions. [2019-12-07 10:42:33,190 INFO L78 Accepts]: Start accepts. Automaton has 7375 states and 16200 transitions. Word has length 31 [2019-12-07 10:42:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:33,190 INFO L462 AbstractCegarLoop]: Abstraction has 7375 states and 16200 transitions. [2019-12-07 10:42:33,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:42:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 7375 states and 16200 transitions. [2019-12-07 10:42:33,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:42:33,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:33,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:33,195 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:33,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:33,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1511424135, now seen corresponding path program 1 times [2019-12-07 10:42:33,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:33,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107695547] [2019-12-07 10:42:33,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:33,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107695547] [2019-12-07 10:42:33,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:33,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:42:33,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100583924] [2019-12-07 10:42:33,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:42:33,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:33,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:42:33,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:42:33,249 INFO L87 Difference]: Start difference. First operand 7375 states and 16200 transitions. Second operand 5 states. [2019-12-07 10:42:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:33,285 INFO L93 Difference]: Finished difference Result 4784 states and 10410 transitions. [2019-12-07 10:42:33,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:42:33,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 10:42:33,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:33,289 INFO L225 Difference]: With dead ends: 4784 [2019-12-07 10:42:33,289 INFO L226 Difference]: Without dead ends: 4500 [2019-12-07 10:42:33,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:42:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4500 states. [2019-12-07 10:42:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4500 to 3777. [2019-12-07 10:42:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3777 states. [2019-12-07 10:42:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3777 states to 3777 states and 8426 transitions. [2019-12-07 10:42:33,323 INFO L78 Accepts]: Start accepts. Automaton has 3777 states and 8426 transitions. Word has length 33 [2019-12-07 10:42:33,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:33,324 INFO L462 AbstractCegarLoop]: Abstraction has 3777 states and 8426 transitions. [2019-12-07 10:42:33,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:42:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3777 states and 8426 transitions. [2019-12-07 10:42:33,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 10:42:33,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:33,328 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] [2019-12-07 10:42:33,328 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:33,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:33,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1959930181, now seen corresponding path program 1 times [2019-12-07 10:42:33,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:33,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865082798] [2019-12-07 10:42:33,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:33,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865082798] [2019-12-07 10:42:33,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:33,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:42:33,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241567183] [2019-12-07 10:42:33,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:42:33,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:33,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:42:33,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:42:33,398 INFO L87 Difference]: Start difference. First operand 3777 states and 8426 transitions. Second operand 5 states. [2019-12-07 10:42:33,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:33,622 INFO L93 Difference]: Finished difference Result 4457 states and 9747 transitions. [2019-12-07 10:42:33,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:42:33,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-07 10:42:33,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:33,626 INFO L225 Difference]: With dead ends: 4457 [2019-12-07 10:42:33,626 INFO L226 Difference]: Without dead ends: 4457 [2019-12-07 10:42:33,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:42:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4457 states. [2019-12-07 10:42:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4457 to 4205. [2019-12-07 10:42:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4205 states. [2019-12-07 10:42:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4205 states to 4205 states and 9290 transitions. [2019-12-07 10:42:33,663 INFO L78 Accepts]: Start accepts. Automaton has 4205 states and 9290 transitions. Word has length 58 [2019-12-07 10:42:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:33,663 INFO L462 AbstractCegarLoop]: Abstraction has 4205 states and 9290 transitions. [2019-12-07 10:42:33,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:42:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4205 states and 9290 transitions. [2019-12-07 10:42:33,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 10:42:33,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:33,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:33,668 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:33,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:33,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2128975279, now seen corresponding path program 2 times [2019-12-07 10:42:33,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:33,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720231080] [2019-12-07 10:42:33,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:33,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720231080] [2019-12-07 10:42:33,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:33,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:42:33,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039048808] [2019-12-07 10:42:33,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:42:33,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:33,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:42:33,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:42:33,813 INFO L87 Difference]: Start difference. First operand 4205 states and 9290 transitions. Second operand 10 states. [2019-12-07 10:42:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:34,625 INFO L93 Difference]: Finished difference Result 6602 states and 14087 transitions. [2019-12-07 10:42:34,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:42:34,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-07 10:42:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:34,630 INFO L225 Difference]: With dead ends: 6602 [2019-12-07 10:42:34,630 INFO L226 Difference]: Without dead ends: 6602 [2019-12-07 10:42:34,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:42:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6602 states. [2019-12-07 10:42:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6602 to 5106. [2019-12-07 10:42:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5106 states. [2019-12-07 10:42:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5106 states to 5106 states and 11029 transitions. [2019-12-07 10:42:34,704 INFO L78 Accepts]: Start accepts. Automaton has 5106 states and 11029 transitions. Word has length 58 [2019-12-07 10:42:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:34,704 INFO L462 AbstractCegarLoop]: Abstraction has 5106 states and 11029 transitions. [2019-12-07 10:42:34,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:42:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5106 states and 11029 transitions. [2019-12-07 10:42:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:42:34,709 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:34,709 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:34,709 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:34,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:34,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1338863250, now seen corresponding path program 1 times [2019-12-07 10:42:34,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:34,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930414579] [2019-12-07 10:42:34,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:34,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930414579] [2019-12-07 10:42:34,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:34,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:42:34,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125793981] [2019-12-07 10:42:34,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:42:34,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:34,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:42:34,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:42:34,756 INFO L87 Difference]: Start difference. First operand 5106 states and 11029 transitions. Second operand 3 states. [2019-12-07 10:42:34,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:34,771 INFO L93 Difference]: Finished difference Result 5105 states and 11027 transitions. [2019-12-07 10:42:34,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:42:34,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 10:42:34,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:34,775 INFO L225 Difference]: With dead ends: 5105 [2019-12-07 10:42:34,775 INFO L226 Difference]: Without dead ends: 5105 [2019-12-07 10:42:34,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:42:34,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2019-12-07 10:42:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 4888. [2019-12-07 10:42:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2019-12-07 10:42:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10613 transitions. [2019-12-07 10:42:34,822 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10613 transitions. Word has length 59 [2019-12-07 10:42:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:34,822 INFO L462 AbstractCegarLoop]: Abstraction has 4888 states and 10613 transitions. [2019-12-07 10:42:34,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:42:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10613 transitions. [2019-12-07 10:42:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:42:34,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:34,827 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:34,827 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:34,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:34,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1500804762, now seen corresponding path program 1 times [2019-12-07 10:42:34,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:34,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217193981] [2019-12-07 10:42:34,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:34,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:34,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217193981] [2019-12-07 10:42:34,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:34,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:42:34,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226133709] [2019-12-07 10:42:34,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:42:34,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:34,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:42:34,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:42:34,867 INFO L87 Difference]: Start difference. First operand 4888 states and 10613 transitions. Second operand 5 states. [2019-12-07 10:42:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:35,029 INFO L93 Difference]: Finished difference Result 5700 states and 12162 transitions. [2019-12-07 10:42:35,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:42:35,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-07 10:42:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:35,033 INFO L225 Difference]: With dead ends: 5700 [2019-12-07 10:42:35,033 INFO L226 Difference]: Without dead ends: 5700 [2019-12-07 10:42:35,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:42:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2019-12-07 10:42:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5000. [2019-12-07 10:42:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5000 states. [2019-12-07 10:42:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5000 states to 5000 states and 10841 transitions. [2019-12-07 10:42:35,078 INFO L78 Accepts]: Start accepts. Automaton has 5000 states and 10841 transitions. Word has length 59 [2019-12-07 10:42:35,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:35,078 INFO L462 AbstractCegarLoop]: Abstraction has 5000 states and 10841 transitions. [2019-12-07 10:42:35,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:42:35,079 INFO L276 IsEmpty]: Start isEmpty. Operand 5000 states and 10841 transitions. [2019-12-07 10:42:35,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:42:35,084 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:35,084 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] [2019-12-07 10:42:35,084 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:35,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:35,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2015434593, now seen corresponding path program 1 times [2019-12-07 10:42:35,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:35,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808893461] [2019-12-07 10:42:35,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:35,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 10:42:35,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808893461] [2019-12-07 10:42:35,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:35,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:42:35,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811311526] [2019-12-07 10:42:35,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:42:35,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:35,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:42:35,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:42:35,228 INFO L87 Difference]: Start difference. First operand 5000 states and 10841 transitions. Second operand 10 states. [2019-12-07 10:42:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:35,991 INFO L93 Difference]: Finished difference Result 8095 states and 17384 transitions. [2019-12-07 10:42:35,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:42:35,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-12-07 10:42:35,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:35,998 INFO L225 Difference]: With dead ends: 8095 [2019-12-07 10:42:35,998 INFO L226 Difference]: Without dead ends: 7622 [2019-12-07 10:42:35,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:42:36,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7622 states. [2019-12-07 10:42:36,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7622 to 6717. [2019-12-07 10:42:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6717 states. [2019-12-07 10:42:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6717 states to 6717 states and 14573 transitions. [2019-12-07 10:42:36,064 INFO L78 Accepts]: Start accepts. Automaton has 6717 states and 14573 transitions. Word has length 60 [2019-12-07 10:42:36,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:36,064 INFO L462 AbstractCegarLoop]: Abstraction has 6717 states and 14573 transitions. [2019-12-07 10:42:36,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:42:36,064 INFO L276 IsEmpty]: Start isEmpty. Operand 6717 states and 14573 transitions. [2019-12-07 10:42:36,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:42:36,071 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:36,071 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] [2019-12-07 10:42:36,071 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:36,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:36,071 INFO L82 PathProgramCache]: Analyzing trace with hash -348317429, now seen corresponding path program 2 times [2019-12-07 10:42:36,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:36,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515994471] [2019-12-07 10:42:36,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:36,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515994471] [2019-12-07 10:42:36,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:36,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:42:36,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434887817] [2019-12-07 10:42:36,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:42:36,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:36,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:42:36,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:42:36,145 INFO L87 Difference]: Start difference. First operand 6717 states and 14573 transitions. Second operand 5 states. [2019-12-07 10:42:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:36,178 INFO L93 Difference]: Finished difference Result 7411 states and 16024 transitions. [2019-12-07 10:42:36,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:42:36,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-07 10:42:36,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:36,179 INFO L225 Difference]: With dead ends: 7411 [2019-12-07 10:42:36,179 INFO L226 Difference]: Without dead ends: 762 [2019-12-07 10:42:36,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:42:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-12-07 10:42:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2019-12-07 10:42:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-12-07 10:42:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1543 transitions. [2019-12-07 10:42:36,185 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1543 transitions. Word has length 60 [2019-12-07 10:42:36,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:36,185 INFO L462 AbstractCegarLoop]: Abstraction has 762 states and 1543 transitions. [2019-12-07 10:42:36,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:42:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1543 transitions. [2019-12-07 10:42:36,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:42:36,186 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:36,186 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] [2019-12-07 10:42:36,187 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:36,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:36,187 INFO L82 PathProgramCache]: Analyzing trace with hash 256933109, now seen corresponding path program 3 times [2019-12-07 10:42:36,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:36,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894564091] [2019-12-07 10:42:36,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:42:36,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894564091] [2019-12-07 10:42:36,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:36,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:42:36,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265412372] [2019-12-07 10:42:36,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:42:36,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:36,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:42:36,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:42:36,261 INFO L87 Difference]: Start difference. First operand 762 states and 1543 transitions. Second operand 8 states. [2019-12-07 10:42:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:36,422 INFO L93 Difference]: Finished difference Result 1280 states and 2541 transitions. [2019-12-07 10:42:36,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:42:36,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-07 10:42:36,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:36,423 INFO L225 Difference]: With dead ends: 1280 [2019-12-07 10:42:36,424 INFO L226 Difference]: Without dead ends: 898 [2019-12-07 10:42:36,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:42:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2019-12-07 10:42:36,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 804. [2019-12-07 10:42:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-12-07 10:42:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1599 transitions. [2019-12-07 10:42:36,430 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1599 transitions. Word has length 60 [2019-12-07 10:42:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:36,430 INFO L462 AbstractCegarLoop]: Abstraction has 804 states and 1599 transitions. [2019-12-07 10:42:36,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:42:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1599 transitions. [2019-12-07 10:42:36,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:42:36,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:36,431 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] [2019-12-07 10:42:36,431 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:36,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:36,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1155043701, now seen corresponding path program 4 times [2019-12-07 10:42:36,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:36,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055416994] [2019-12-07 10:42:36,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:42:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:42:36,498 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:42:36,498 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:42:36,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y~0_249 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1727~0.base_28| 4)) (= 0 v_~y$w_buff0~0_205) (= v_~y$w_buff0_used~0_843 0) (= v_~y$w_buff1_used~0_439 0) (= 0 v_~weak$$choice0~0_156) (= v_~main$tmp_guard1~0_42 0) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p0_EAX~0_77) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1727~0.base_28|) (= v_~__unbuffered_p0_EBX~0_51 0) (= v_~y$read_delayed~0_6 0) (= v_~weak$$choice2~0_238 0) (= v_~y$r_buff0_thd0~0_100 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd2~0_306) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1727~0.base_28|)) (= |v_ULTIMATE.start_main_~#t1727~0.offset_20| 0) (= v_~x~0_52 0) (= 0 v_~y$r_buff0_thd2~0_438) (= v_~y$r_buff1_thd1~0_261 0) (= 0 v_~__unbuffered_cnt~0_49) (= v_~__unbuffered_p1_EBX~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= v_~y$w_buff1~0_192 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1727~0.base_28| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1727~0.base_28| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1727~0.base_28|) |v_ULTIMATE.start_main_~#t1727~0.offset_20| 0)) |v_#memory_int_13|) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$flush_delayed~0_191 0) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff0_thd1~0_295 0) (= v_~y$r_buff1_thd0~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_843, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_14|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_~#t1727~0.offset=|v_ULTIMATE.start_main_~#t1727~0.offset_20|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_261, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_15|, ULTIMATE.start_main_~#t1728~0.base=|v_ULTIMATE.start_main_~#t1728~0.base_17|, ULTIMATE.start_main_~#t1728~0.offset=|v_ULTIMATE.start_main_~#t1728~0.offset_14|, ~y~0=v_~y~0_249, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_51, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_103|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_147|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_85|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_306, ~weak$$choice0~0=v_~weak$$choice0~0_156, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_115|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_29|, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, #valid=|v_#valid_53|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_438, #memory_int=|v_#memory_int_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ULTIMATE.start_main_~#t1727~0.base=|v_ULTIMATE.start_main_~#t1727~0.base_28|, ~weak$$choice2~0=v_~weak$$choice2~0_238, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~x~0=v_~x~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1727~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1728~0.base, ULTIMATE.start_main_~#t1728~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1727~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:42:36,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1728~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1728~0.base_13|) |v_ULTIMATE.start_main_~#t1728~0.offset_11| 1))) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1728~0.base_13|) 0) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1728~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1728~0.base_13|) (= |v_ULTIMATE.start_main_~#t1728~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1728~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1728~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1728~0.base=|v_ULTIMATE.start_main_~#t1728~0.base_13|, ULTIMATE.start_main_~#t1728~0.offset=|v_ULTIMATE.start_main_~#t1728~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1728~0.base, ULTIMATE.start_main_~#t1728~0.offset] because there is no mapped edge [2019-12-07 10:42:36,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= v_~y$w_buff0~0_39 v_~y$w_buff1~0_51) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~y$w_buff0~0_38) (= v_~y$w_buff0_used~0_162 1) (= v_~y$w_buff1_used~0_84 v_~y$w_buff0_used~0_163) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_162 256))))) 1 0)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_39, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_51, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~y$w_buff0~0=v_~y$w_buff0~0_38, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:42:36,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1875651228 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1875651228 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out1875651228| ~y$w_buff0~0_In1875651228)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out1875651228| ~y$w_buff1~0_In1875651228) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1875651228, ~y$w_buff1~0=~y$w_buff1~0_In1875651228, ~y$w_buff0~0=~y$w_buff0~0_In1875651228, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1875651228} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1875651228, ~y$w_buff1~0=~y$w_buff1~0_In1875651228, ~y$w_buff0~0=~y$w_buff0~0_In1875651228, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1875651228, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1875651228|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:42:36,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_77 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~y~0=v_~y~0_77, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:42:36,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 10:42:36,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In2014710155 256)))) (or (and (= ~y~0_In2014710155 |P1Thread1of1ForFork1_#t~ite48_Out2014710155|) .cse0) (and (not .cse0) (= ~y$mem_tmp~0_In2014710155 |P1Thread1of1ForFork1_#t~ite48_Out2014710155|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In2014710155, ~y$flush_delayed~0=~y$flush_delayed~0_In2014710155, ~y~0=~y~0_In2014710155} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In2014710155, ~y$flush_delayed~0=~y$flush_delayed~0_In2014710155, ~y~0=~y~0_In2014710155, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out2014710155|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 10:42:36,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In762168522 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In762168522 256)))) (or (and (= ~y$w_buff0_used~0_In762168522 |P1Thread1of1ForFork1_#t~ite51_Out762168522|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out762168522|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In762168522, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In762168522} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In762168522, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out762168522|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In762168522} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 10:42:36,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1628056268 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1628056268 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1628056268 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1628056268 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-1628056268|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1628056268 |P1Thread1of1ForFork1_#t~ite52_Out-1628056268|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1628056268, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1628056268, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1628056268, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1628056268} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1628056268, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1628056268, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-1628056268|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1628056268, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1628056268} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 10:42:36,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_Out-481338185 ~y$r_buff0_thd2~0_In-481338185)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-481338185 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-481338185 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= ~y$r_buff0_thd2~0_Out-481338185 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-481338185, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-481338185} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-481338185|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-481338185, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-481338185} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:42:36,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1796242773 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1796242773 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1796242773 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1796242773 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite54_Out-1796242773|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In-1796242773 |P1Thread1of1ForFork1_#t~ite54_Out-1796242773|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1796242773, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1796242773, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1796242773, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1796242773} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1796242773, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1796242773, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1796242773, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1796242773|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1796242773} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 10:42:36,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_119 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:42:36,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1359888456 256)))) (or (and (= ~y$mem_tmp~0_In-1359888456 |P0Thread1of1ForFork0_#t~ite25_Out-1359888456|) (not .cse0)) (and .cse0 (= ~y~0_In-1359888456 |P0Thread1of1ForFork0_#t~ite25_Out-1359888456|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1359888456, ~y$flush_delayed~0=~y$flush_delayed~0_In-1359888456, ~y~0=~y~0_In-1359888456} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1359888456, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-1359888456|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1359888456, ~y~0=~y~0_In-1359888456} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 10:42:36,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y~0_124 |v_P0Thread1of1ForFork0_#t~ite25_18|) (= 0 v_~y$flush_delayed~0_78) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y~0=v_~y~0_124} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 10:42:36,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= 0 (mod v_~y$w_buff0_used~0_212 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:42:36,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1970361213 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1970361213 256) 0))) (or (and (= ~y$w_buff1~0_In-1970361213 |ULTIMATE.start_main_#t~ite57_Out-1970361213|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite57_Out-1970361213| ~y~0_In-1970361213) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1970361213, ~y~0=~y~0_In-1970361213, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1970361213, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1970361213} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1970361213, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1970361213|, ~y~0=~y~0_In-1970361213, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1970361213, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1970361213} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 10:42:36,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite57_9|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_9|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-07 10:42:36,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1042219573 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1042219573 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1042219573| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1042219573| ~y$w_buff0_used~0_In1042219573)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1042219573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1042219573} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1042219573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1042219573, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1042219573|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:42:36,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In584233638 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In584233638 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In584233638 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In584233638 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite60_Out584233638| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In584233638 |ULTIMATE.start_main_#t~ite60_Out584233638|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In584233638, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In584233638, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In584233638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In584233638} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out584233638|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In584233638, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In584233638, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In584233638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In584233638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:42:36,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-965602477 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-965602477 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-965602477| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out-965602477| ~y$r_buff0_thd0~0_In-965602477) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-965602477, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-965602477} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-965602477|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-965602477, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-965602477} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:42:36,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-439012639 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-439012639 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-439012639 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-439012639 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-439012639| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out-439012639| ~y$r_buff1_thd0~0_In-439012639) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-439012639, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-439012639, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-439012639, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-439012639} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-439012639|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-439012639, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-439012639, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-439012639, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-439012639} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:42:36,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_175 |v_ULTIMATE.start_main_#t~ite62_45|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p0_EAX~0_55) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p1_EAX~0_36))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_175, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, 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 10:42:36,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:42:36 BasicIcfg [2019-12-07 10:42:36,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:42:36,563 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:42:36,563 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:42:36,563 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:42:36,563 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:42:21" (3/4) ... [2019-12-07 10:42:36,565 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:42:36,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y~0_249 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1727~0.base_28| 4)) (= 0 v_~y$w_buff0~0_205) (= v_~y$w_buff0_used~0_843 0) (= v_~y$w_buff1_used~0_439 0) (= 0 v_~weak$$choice0~0_156) (= v_~main$tmp_guard1~0_42 0) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p0_EAX~0_77) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1727~0.base_28|) (= v_~__unbuffered_p0_EBX~0_51 0) (= v_~y$read_delayed~0_6 0) (= v_~weak$$choice2~0_238 0) (= v_~y$r_buff0_thd0~0_100 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd2~0_306) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1727~0.base_28|)) (= |v_ULTIMATE.start_main_~#t1727~0.offset_20| 0) (= v_~x~0_52 0) (= 0 v_~y$r_buff0_thd2~0_438) (= v_~y$r_buff1_thd1~0_261 0) (= 0 v_~__unbuffered_cnt~0_49) (= v_~__unbuffered_p1_EBX~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= v_~y$w_buff1~0_192 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1727~0.base_28| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1727~0.base_28| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1727~0.base_28|) |v_ULTIMATE.start_main_~#t1727~0.offset_20| 0)) |v_#memory_int_13|) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$flush_delayed~0_191 0) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff0_thd1~0_295 0) (= v_~y$r_buff1_thd0~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_843, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_14|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_~#t1727~0.offset=|v_ULTIMATE.start_main_~#t1727~0.offset_20|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_261, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_15|, ULTIMATE.start_main_~#t1728~0.base=|v_ULTIMATE.start_main_~#t1728~0.base_17|, ULTIMATE.start_main_~#t1728~0.offset=|v_ULTIMATE.start_main_~#t1728~0.offset_14|, ~y~0=v_~y~0_249, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_51, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_103|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_147|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_85|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_306, ~weak$$choice0~0=v_~weak$$choice0~0_156, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_115|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_29|, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, #valid=|v_#valid_53|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_438, #memory_int=|v_#memory_int_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ULTIMATE.start_main_~#t1727~0.base=|v_ULTIMATE.start_main_~#t1727~0.base_28|, ~weak$$choice2~0=v_~weak$$choice2~0_238, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~x~0=v_~x~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1727~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1728~0.base, ULTIMATE.start_main_~#t1728~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1727~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:42:36,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1728~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1728~0.base_13|) |v_ULTIMATE.start_main_~#t1728~0.offset_11| 1))) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1728~0.base_13|) 0) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1728~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1728~0.base_13|) (= |v_ULTIMATE.start_main_~#t1728~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1728~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1728~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1728~0.base=|v_ULTIMATE.start_main_~#t1728~0.base_13|, ULTIMATE.start_main_~#t1728~0.offset=|v_ULTIMATE.start_main_~#t1728~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1728~0.base, ULTIMATE.start_main_~#t1728~0.offset] because there is no mapped edge [2019-12-07 10:42:36,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= v_~y$w_buff0~0_39 v_~y$w_buff1~0_51) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~y$w_buff0~0_38) (= v_~y$w_buff0_used~0_162 1) (= v_~y$w_buff1_used~0_84 v_~y$w_buff0_used~0_163) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_162 256))))) 1 0)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_39, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_51, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~y$w_buff0~0=v_~y$w_buff0~0_38, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:42:36,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1875651228 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1875651228 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out1875651228| ~y$w_buff0~0_In1875651228)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out1875651228| ~y$w_buff1~0_In1875651228) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1875651228, ~y$w_buff1~0=~y$w_buff1~0_In1875651228, ~y$w_buff0~0=~y$w_buff0~0_In1875651228, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1875651228} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1875651228, ~y$w_buff1~0=~y$w_buff1~0_In1875651228, ~y$w_buff0~0=~y$w_buff0~0_In1875651228, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1875651228, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1875651228|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:42:36,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_77 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~y~0=v_~y~0_77, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:42:36,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 10:42:36,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In2014710155 256)))) (or (and (= ~y~0_In2014710155 |P1Thread1of1ForFork1_#t~ite48_Out2014710155|) .cse0) (and (not .cse0) (= ~y$mem_tmp~0_In2014710155 |P1Thread1of1ForFork1_#t~ite48_Out2014710155|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In2014710155, ~y$flush_delayed~0=~y$flush_delayed~0_In2014710155, ~y~0=~y~0_In2014710155} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In2014710155, ~y$flush_delayed~0=~y$flush_delayed~0_In2014710155, ~y~0=~y~0_In2014710155, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out2014710155|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 10:42:36,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In762168522 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In762168522 256)))) (or (and (= ~y$w_buff0_used~0_In762168522 |P1Thread1of1ForFork1_#t~ite51_Out762168522|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out762168522|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In762168522, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In762168522} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In762168522, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out762168522|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In762168522} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 10:42:36,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1628056268 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1628056268 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1628056268 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1628056268 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-1628056268|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1628056268 |P1Thread1of1ForFork1_#t~ite52_Out-1628056268|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1628056268, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1628056268, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1628056268, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1628056268} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1628056268, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1628056268, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-1628056268|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1628056268, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1628056268} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 10:42:36,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_Out-481338185 ~y$r_buff0_thd2~0_In-481338185)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-481338185 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-481338185 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= ~y$r_buff0_thd2~0_Out-481338185 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-481338185, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-481338185} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-481338185|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-481338185, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-481338185} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:42:36,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1796242773 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1796242773 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1796242773 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1796242773 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite54_Out-1796242773|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In-1796242773 |P1Thread1of1ForFork1_#t~ite54_Out-1796242773|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1796242773, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1796242773, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1796242773, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1796242773} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1796242773, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1796242773, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1796242773, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1796242773|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1796242773} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 10:42:36,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_119 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:42:36,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1359888456 256)))) (or (and (= ~y$mem_tmp~0_In-1359888456 |P0Thread1of1ForFork0_#t~ite25_Out-1359888456|) (not .cse0)) (and .cse0 (= ~y~0_In-1359888456 |P0Thread1of1ForFork0_#t~ite25_Out-1359888456|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1359888456, ~y$flush_delayed~0=~y$flush_delayed~0_In-1359888456, ~y~0=~y~0_In-1359888456} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1359888456, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-1359888456|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1359888456, ~y~0=~y~0_In-1359888456} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 10:42:36,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y~0_124 |v_P0Thread1of1ForFork0_#t~ite25_18|) (= 0 v_~y$flush_delayed~0_78) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y~0=v_~y~0_124} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 10:42:36,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= 0 (mod v_~y$w_buff0_used~0_212 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:42:36,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1970361213 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1970361213 256) 0))) (or (and (= ~y$w_buff1~0_In-1970361213 |ULTIMATE.start_main_#t~ite57_Out-1970361213|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite57_Out-1970361213| ~y~0_In-1970361213) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1970361213, ~y~0=~y~0_In-1970361213, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1970361213, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1970361213} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1970361213, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1970361213|, ~y~0=~y~0_In-1970361213, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1970361213, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1970361213} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 10:42:36,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite57_9|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_9|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-07 10:42:36,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1042219573 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1042219573 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1042219573| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1042219573| ~y$w_buff0_used~0_In1042219573)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1042219573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1042219573} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1042219573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1042219573, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1042219573|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:42:36,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In584233638 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In584233638 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In584233638 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In584233638 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite60_Out584233638| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In584233638 |ULTIMATE.start_main_#t~ite60_Out584233638|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In584233638, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In584233638, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In584233638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In584233638} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out584233638|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In584233638, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In584233638, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In584233638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In584233638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:42:36,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-965602477 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-965602477 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-965602477| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out-965602477| ~y$r_buff0_thd0~0_In-965602477) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-965602477, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-965602477} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-965602477|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-965602477, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-965602477} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:42:36,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-439012639 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-439012639 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-439012639 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-439012639 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-439012639| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out-439012639| ~y$r_buff1_thd0~0_In-439012639) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-439012639, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-439012639, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-439012639, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-439012639} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-439012639|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-439012639, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-439012639, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-439012639, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-439012639} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:42:36,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_175 |v_ULTIMATE.start_main_#t~ite62_45|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p0_EAX~0_55) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p1_EAX~0_36))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_175, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, 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 10:42:36,636 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c2331947-ddbc-4e5f-8bf1-5e2b2986f00a/bin/uautomizer/witness.graphml [2019-12-07 10:42:36,636 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:42:36,637 INFO L168 Benchmark]: Toolchain (without parser) took 16179.31 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 937.0 MB in the beginning and 925.5 MB in the end (delta: 11.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 10:42:36,638 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:42:36,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -129.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:36,638 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:36,638 INFO L168 Benchmark]: Boogie Preprocessor took 26.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:36,639 INFO L168 Benchmark]: RCFGBuilder took 431.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:36,639 INFO L168 Benchmark]: TraceAbstraction took 15226.66 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 953.2 MB). Free memory was 1.0 GB in the beginning and 968.0 MB in the end (delta: 32.8 MB). Peak memory consumption was 986.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:36,639 INFO L168 Benchmark]: Witness Printer took 73.52 ms. Allocated memory is still 2.1 GB. Free memory was 968.0 MB in the beginning and 925.5 MB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:36,641 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 376.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -129.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.54 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 431.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15226.66 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 953.2 MB). Free memory was 1.0 GB in the beginning and 968.0 MB in the end (delta: 32.8 MB). Peak memory consumption was 986.0 MB. Max. memory is 11.5 GB. * Witness Printer took 73.52 ms. Allocated memory is still 2.1 GB. Free memory was 968.0 MB in the beginning and 925.5 MB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 179 ProgramPointsBefore, 105 ProgramPointsAfterwards, 228 TransitionsBefore, 129 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 28 ChoiceCompositions, 9059 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 68 SemBasedMoverChecksPositive, 299 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 125257 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1727, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L815] FCALL, FORK 0 pthread_create(&t1728, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 y$flush_delayed = weak$$choice2 [L774] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L775] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L776] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L776] 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)) [L777] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L777] 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)) [L778] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L778] 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)) [L779] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L779] 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)) [L781] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 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)) [L782] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L783] 2 y = y$flush_delayed ? y$mem_tmp : y [L784] 2 y$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L729] 1 x = 1 [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L744] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L745] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 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 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.0s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3296 SDtfs, 3756 SDslu, 6814 SDs, 0 SdLazy, 3643 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60518occurred 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: 4.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 20165 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 644 NumberOfCodeBlocks, 644 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 568 ConstructedInterpolants, 0 QuantifiedInterpolants, 110932 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...