./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix015_rmo.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_56a24975-8ab2-4157-9ad3-6d7c3fede961/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_56a24975-8ab2-4157-9ad3-6d7c3fede961/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_56a24975-8ab2-4157-9ad3-6d7c3fede961/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_56a24975-8ab2-4157-9ad3-6d7c3fede961/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix015_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_56a24975-8ab2-4157-9ad3-6d7c3fede961/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_56a24975-8ab2-4157-9ad3-6d7c3fede961/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 e4f03a3f35ca4521585902a7726a8f86f22ade20 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:13:11,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:13:11,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:13:11,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:13:11,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:13:11,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:13:11,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:13:11,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:13:11,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:13:11,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:13:11,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:13:11,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:13:11,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:13:11,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:13:11,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:13:11,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:13:11,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:13:11,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:13:11,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:13:11,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:13:11,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:13:11,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:13:11,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:13:11,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:13:11,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:13:11,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:13:11,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:13:11,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:13:11,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:13:11,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:13:11,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:13:11,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:13:11,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:13:11,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:13:11,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:13:11,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:13:11,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:13:11,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:13:11,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:13:11,965 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:13:11,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:13:11,966 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_56a24975-8ab2-4157-9ad3-6d7c3fede961/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:13:11,976 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:13:11,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:13:11,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:13:11,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:13:11,977 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:13:11,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:13:11,977 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:13:11,977 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:13:11,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:13:11,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:13:11,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:13:11,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:13:11,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:13:11,978 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:13:11,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:13:11,978 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:13:11,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:13:11,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:13:11,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:13:11,979 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:13:11,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:13:11,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:13:11,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:13:11,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:13:11,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:13:11,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:13:11,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:13:11,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:13:11,980 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:13:11,980 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_56a24975-8ab2-4157-9ad3-6d7c3fede961/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 -> e4f03a3f35ca4521585902a7726a8f86f22ade20 [2019-12-07 18:13:12,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:13:12,088 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:13:12,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:13:12,092 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:13:12,092 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:13:12,093 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_56a24975-8ab2-4157-9ad3-6d7c3fede961/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix015_rmo.opt.i [2019-12-07 18:13:12,134 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_56a24975-8ab2-4157-9ad3-6d7c3fede961/bin/uautomizer/data/45cfbc027/9345a755ceb942f487df9018a5618e07/FLAG9c94bccb2 [2019-12-07 18:13:12,492 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:13:12,493 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_56a24975-8ab2-4157-9ad3-6d7c3fede961/sv-benchmarks/c/pthread-wmm/mix015_rmo.opt.i [2019-12-07 18:13:12,503 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_56a24975-8ab2-4157-9ad3-6d7c3fede961/bin/uautomizer/data/45cfbc027/9345a755ceb942f487df9018a5618e07/FLAG9c94bccb2 [2019-12-07 18:13:12,511 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_56a24975-8ab2-4157-9ad3-6d7c3fede961/bin/uautomizer/data/45cfbc027/9345a755ceb942f487df9018a5618e07 [2019-12-07 18:13:12,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:13:12,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:13:12,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:13:12,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:13:12,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:13:12,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:13:12" (1/1) ... [2019-12-07 18:13:12,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@591cea7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:13:12, skipping insertion in model container [2019-12-07 18:13:12,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:13:12" (1/1) ... [2019-12-07 18:13:12,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:13:12,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:13:12,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:13:12,856 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:13:12,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:13:12,976 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:13:12,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:13:12 WrapperNode [2019-12-07 18:13:12,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:13:12,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:13:12,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:13:12,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:13:12,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:13:12" (1/1) ... [2019-12-07 18:13:12,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:13:12" (1/1) ... [2019-12-07 18:13:13,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:13:13,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:13:13,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:13:13,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:13:13,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:13:12" (1/1) ... [2019-12-07 18:13:13,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:13:12" (1/1) ... [2019-12-07 18:13:13,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:13:12" (1/1) ... [2019-12-07 18:13:13,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:13:12" (1/1) ... [2019-12-07 18:13:13,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:13:12" (1/1) ... [2019-12-07 18:13:13,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:13:12" (1/1) ... [2019-12-07 18:13:13,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:13:12" (1/1) ... [2019-12-07 18:13:13,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:13:13,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:13:13,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:13:13,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:13:13,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:13:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56a24975-8ab2-4157-9ad3-6d7c3fede961/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 18:13:13,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:13:13,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:13:13,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:13:13,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:13:13,091 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:13:13,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:13:13,092 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:13:13,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:13:13,092 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:13:13,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:13:13,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:13:13,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:13:13,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:13:13,094 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 18:13:13,489 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:13:13,489 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:13:13,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:13:13 BoogieIcfgContainer [2019-12-07 18:13:13,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:13:13,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:13:13,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:13:13,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:13:13,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:13:12" (1/3) ... [2019-12-07 18:13:13,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261405a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:13:13, skipping insertion in model container [2019-12-07 18:13:13,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:13:12" (2/3) ... [2019-12-07 18:13:13,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261405a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:13:13, skipping insertion in model container [2019-12-07 18:13:13,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:13:13" (3/3) ... [2019-12-07 18:13:13,495 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_rmo.opt.i [2019-12-07 18:13:13,501 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:13:13,501 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:13:13,506 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:13:13,506 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:13:13,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,535 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,535 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,537 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,537 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,553 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,553 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,553 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,554 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,554 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:13:13,586 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 18:13:13,599 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:13:13,599 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:13:13,599 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:13:13,599 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:13:13,599 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:13:13,599 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:13:13,599 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:13:13,599 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:13:13,610 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-07 18:13:13,611 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 18:13:13,678 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 18:13:13,678 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:13:13,692 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 922 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 18:13:13,714 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 18:13:13,748 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 18:13:13,748 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:13:13,756 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 922 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 18:13:13,779 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 18:13:13,779 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:13:17,127 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-07 18:13:17,417 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 18:13:17,523 INFO L206 etLargeBlockEncoding]: Checked pairs total: 124397 [2019-12-07 18:13:17,524 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-07 18:13:17,526 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 130 transitions [2019-12-07 18:13:20,229 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44886 states. [2019-12-07 18:13:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 44886 states. [2019-12-07 18:13:20,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 18:13:20,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:20,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:13:20,236 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:20,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:20,239 INFO L82 PathProgramCache]: Analyzing trace with hash -615654133, now seen corresponding path program 1 times [2019-12-07 18:13:20,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:20,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840605385] [2019-12-07 18:13:20,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:20,389 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 18:13:20,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840605385] [2019-12-07 18:13:20,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:20,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:13:20,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940722982] [2019-12-07 18:13:20,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:13:20,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:20,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:13:20,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:13:20,404 INFO L87 Difference]: Start difference. First operand 44886 states. Second operand 3 states. [2019-12-07 18:13:20,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:20,784 INFO L93 Difference]: Finished difference Result 44562 states and 182514 transitions. [2019-12-07 18:13:20,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:13:20,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 18:13:20,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:21,039 INFO L225 Difference]: With dead ends: 44562 [2019-12-07 18:13:21,039 INFO L226 Difference]: Without dead ends: 41502 [2019-12-07 18:13:21,040 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 18:13:21,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41502 states. [2019-12-07 18:13:22,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41502 to 41502. [2019-12-07 18:13:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41502 states. [2019-12-07 18:13:22,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41502 states to 41502 states and 169862 transitions. [2019-12-07 18:13:22,591 INFO L78 Accepts]: Start accepts. Automaton has 41502 states and 169862 transitions. Word has length 7 [2019-12-07 18:13:22,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:22,592 INFO L462 AbstractCegarLoop]: Abstraction has 41502 states and 169862 transitions. [2019-12-07 18:13:22,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:13:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 41502 states and 169862 transitions. [2019-12-07 18:13:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:13:22,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:22,596 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:13:22,596 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:22,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:22,596 INFO L82 PathProgramCache]: Analyzing trace with hash -42181455, now seen corresponding path program 1 times [2019-12-07 18:13:22,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:22,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784191348] [2019-12-07 18:13:22,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:22,654 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 18:13:22,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784191348] [2019-12-07 18:13:22,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:22,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:13:22,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467111346] [2019-12-07 18:13:22,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:13:22,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:22,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:13:22,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:13:22,656 INFO L87 Difference]: Start difference. First operand 41502 states and 169862 transitions. Second operand 4 states. [2019-12-07 18:13:23,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:23,207 INFO L93 Difference]: Finished difference Result 66122 states and 260012 transitions. [2019-12-07 18:13:23,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:13:23,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 18:13:23,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:23,526 INFO L225 Difference]: With dead ends: 66122 [2019-12-07 18:13:23,526 INFO L226 Difference]: Without dead ends: 66092 [2019-12-07 18:13:23,527 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 18:13:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66092 states. [2019-12-07 18:13:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66092 to 64446. [2019-12-07 18:13:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64446 states. [2019-12-07 18:13:25,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64446 states to 64446 states and 254822 transitions. [2019-12-07 18:13:25,359 INFO L78 Accepts]: Start accepts. Automaton has 64446 states and 254822 transitions. Word has length 13 [2019-12-07 18:13:25,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:25,359 INFO L462 AbstractCegarLoop]: Abstraction has 64446 states and 254822 transitions. [2019-12-07 18:13:25,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:13:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 64446 states and 254822 transitions. [2019-12-07 18:13:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:13:25,364 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:25,364 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:13:25,364 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:25,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:25,364 INFO L82 PathProgramCache]: Analyzing trace with hash -902377345, now seen corresponding path program 1 times [2019-12-07 18:13:25,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:25,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911838614] [2019-12-07 18:13:25,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:25,409 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 18:13:25,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911838614] [2019-12-07 18:13:25,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:25,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:13:25,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402936320] [2019-12-07 18:13:25,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:13:25,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:25,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:13:25,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:13:25,411 INFO L87 Difference]: Start difference. First operand 64446 states and 254822 transitions. Second operand 4 states. [2019-12-07 18:13:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:25,876 INFO L93 Difference]: Finished difference Result 82254 states and 320688 transitions. [2019-12-07 18:13:25,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:13:25,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 18:13:25,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:26,052 INFO L225 Difference]: With dead ends: 82254 [2019-12-07 18:13:26,052 INFO L226 Difference]: Without dead ends: 82226 [2019-12-07 18:13:26,053 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 18:13:26,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82226 states. [2019-12-07 18:13:27,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82226 to 73414. [2019-12-07 18:13:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73414 states. [2019-12-07 18:13:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73414 states to 73414 states and 288912 transitions. [2019-12-07 18:13:29,464 INFO L78 Accepts]: Start accepts. Automaton has 73414 states and 288912 transitions. Word has length 16 [2019-12-07 18:13:29,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:29,464 INFO L462 AbstractCegarLoop]: Abstraction has 73414 states and 288912 transitions. [2019-12-07 18:13:29,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:13:29,464 INFO L276 IsEmpty]: Start isEmpty. Operand 73414 states and 288912 transitions. [2019-12-07 18:13:29,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:13:29,470 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:29,470 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:13:29,471 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:29,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:29,471 INFO L82 PathProgramCache]: Analyzing trace with hash 486877996, now seen corresponding path program 1 times [2019-12-07 18:13:29,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:29,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395003020] [2019-12-07 18:13:29,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:29,537 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 18:13:29,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395003020] [2019-12-07 18:13:29,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:29,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:13:29,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930599250] [2019-12-07 18:13:29,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:13:29,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:29,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:13:29,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:13:29,538 INFO L87 Difference]: Start difference. First operand 73414 states and 288912 transitions. Second operand 3 states. [2019-12-07 18:13:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:29,825 INFO L93 Difference]: Finished difference Result 71385 states and 279482 transitions. [2019-12-07 18:13:29,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:13:29,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 18:13:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:29,979 INFO L225 Difference]: With dead ends: 71385 [2019-12-07 18:13:29,979 INFO L226 Difference]: Without dead ends: 71385 [2019-12-07 18:13:29,980 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 18:13:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71385 states. [2019-12-07 18:13:31,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71385 to 71336. [2019-12-07 18:13:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71336 states. [2019-12-07 18:13:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71336 states to 71336 states and 279400 transitions. [2019-12-07 18:13:31,757 INFO L78 Accepts]: Start accepts. Automaton has 71336 states and 279400 transitions. Word has length 18 [2019-12-07 18:13:31,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:31,757 INFO L462 AbstractCegarLoop]: Abstraction has 71336 states and 279400 transitions. [2019-12-07 18:13:31,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:13:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 71336 states and 279400 transitions. [2019-12-07 18:13:31,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:13:31,764 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:31,764 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:13:31,764 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:31,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:31,765 INFO L82 PathProgramCache]: Analyzing trace with hash -736056884, now seen corresponding path program 1 times [2019-12-07 18:13:31,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:31,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846663624] [2019-12-07 18:13:31,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:31,799 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 18:13:31,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846663624] [2019-12-07 18:13:31,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:31,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:13:31,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369246413] [2019-12-07 18:13:31,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:13:31,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:31,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:13:31,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:13:31,801 INFO L87 Difference]: Start difference. First operand 71336 states and 279400 transitions. Second operand 3 states. [2019-12-07 18:13:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:32,071 INFO L93 Difference]: Finished difference Result 68874 states and 270636 transitions. [2019-12-07 18:13:32,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:13:32,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 18:13:32,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:32,216 INFO L225 Difference]: With dead ends: 68874 [2019-12-07 18:13:32,217 INFO L226 Difference]: Without dead ends: 68874 [2019-12-07 18:13:32,217 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 18:13:32,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68874 states. [2019-12-07 18:13:33,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68874 to 68874. [2019-12-07 18:13:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68874 states. [2019-12-07 18:13:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68874 states to 68874 states and 270636 transitions. [2019-12-07 18:13:33,978 INFO L78 Accepts]: Start accepts. Automaton has 68874 states and 270636 transitions. Word has length 19 [2019-12-07 18:13:33,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:33,978 INFO L462 AbstractCegarLoop]: Abstraction has 68874 states and 270636 transitions. [2019-12-07 18:13:33,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:13:33,978 INFO L276 IsEmpty]: Start isEmpty. Operand 68874 states and 270636 transitions. [2019-12-07 18:13:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:13:33,990 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:33,990 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:13:33,990 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:33,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:33,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1365741285, now seen corresponding path program 1 times [2019-12-07 18:13:33,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:33,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172308265] [2019-12-07 18:13:33,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:34,031 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 18:13:34,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172308265] [2019-12-07 18:13:34,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:34,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:13:34,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977870965] [2019-12-07 18:13:34,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:13:34,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:34,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:13:34,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:13:34,033 INFO L87 Difference]: Start difference. First operand 68874 states and 270636 transitions. Second operand 5 states. [2019-12-07 18:13:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:34,710 INFO L93 Difference]: Finished difference Result 81922 states and 317702 transitions. [2019-12-07 18:13:34,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:13:34,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 18:13:34,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:34,880 INFO L225 Difference]: With dead ends: 81922 [2019-12-07 18:13:34,880 INFO L226 Difference]: Without dead ends: 81870 [2019-12-07 18:13:34,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:13:35,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81870 states. [2019-12-07 18:13:36,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81870 to 68462. [2019-12-07 18:13:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68462 states. [2019-12-07 18:13:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68462 states to 68462 states and 269172 transitions. [2019-12-07 18:13:36,825 INFO L78 Accepts]: Start accepts. Automaton has 68462 states and 269172 transitions. Word has length 22 [2019-12-07 18:13:36,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:36,825 INFO L462 AbstractCegarLoop]: Abstraction has 68462 states and 269172 transitions. [2019-12-07 18:13:36,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:13:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 68462 states and 269172 transitions. [2019-12-07 18:13:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:13:36,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:36,891 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] [2019-12-07 18:13:36,891 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:36,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:36,891 INFO L82 PathProgramCache]: Analyzing trace with hash -751483293, now seen corresponding path program 1 times [2019-12-07 18:13:36,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:36,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024098326] [2019-12-07 18:13:36,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:36,940 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 18:13:36,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024098326] [2019-12-07 18:13:36,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:36,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:13:36,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63747830] [2019-12-07 18:13:36,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:13:36,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:36,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:13:36,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:13:36,941 INFO L87 Difference]: Start difference. First operand 68462 states and 269172 transitions. Second operand 4 states. [2019-12-07 18:13:37,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:37,099 INFO L93 Difference]: Finished difference Result 42303 states and 145386 transitions. [2019-12-07 18:13:37,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:13:37,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-07 18:13:37,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:37,160 INFO L225 Difference]: With dead ends: 42303 [2019-12-07 18:13:37,160 INFO L226 Difference]: Without dead ends: 37931 [2019-12-07 18:13:37,160 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 18:13:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37931 states. [2019-12-07 18:13:37,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37931 to 37931. [2019-12-07 18:13:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37931 states. [2019-12-07 18:13:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37931 states to 37931 states and 130187 transitions. [2019-12-07 18:13:37,926 INFO L78 Accepts]: Start accepts. Automaton has 37931 states and 130187 transitions. Word has length 32 [2019-12-07 18:13:37,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:37,926 INFO L462 AbstractCegarLoop]: Abstraction has 37931 states and 130187 transitions. [2019-12-07 18:13:37,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:13:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 37931 states and 130187 transitions. [2019-12-07 18:13:37,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:13:37,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:37,954 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 18:13:37,954 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:37,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:37,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1501647613, now seen corresponding path program 1 times [2019-12-07 18:13:37,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:37,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021454302] [2019-12-07 18:13:37,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:38,007 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 18:13:38,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021454302] [2019-12-07 18:13:38,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:38,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:13:38,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549286791] [2019-12-07 18:13:38,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:13:38,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:38,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:13:38,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:13:38,008 INFO L87 Difference]: Start difference. First operand 37931 states and 130187 transitions. Second operand 5 states. [2019-12-07 18:13:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:38,266 INFO L93 Difference]: Finished difference Result 57698 states and 201251 transitions. [2019-12-07 18:13:38,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:13:38,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 18:13:38,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:38,355 INFO L225 Difference]: With dead ends: 57698 [2019-12-07 18:13:38,356 INFO L226 Difference]: Without dead ends: 50142 [2019-12-07 18:13:38,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:13:38,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50142 states. [2019-12-07 18:13:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50142 to 50142. [2019-12-07 18:13:39,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50142 states. [2019-12-07 18:13:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50142 states to 50142 states and 175482 transitions. [2019-12-07 18:13:39,427 INFO L78 Accepts]: Start accepts. Automaton has 50142 states and 175482 transitions. Word has length 33 [2019-12-07 18:13:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:39,427 INFO L462 AbstractCegarLoop]: Abstraction has 50142 states and 175482 transitions. [2019-12-07 18:13:39,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:13:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 50142 states and 175482 transitions. [2019-12-07 18:13:39,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:13:39,467 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:39,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:13:39,468 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:39,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:39,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1577527187, now seen corresponding path program 2 times [2019-12-07 18:13:39,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:39,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295060100] [2019-12-07 18:13:39,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:39,505 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 18:13:39,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295060100] [2019-12-07 18:13:39,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:39,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:13:39,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097036386] [2019-12-07 18:13:39,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:13:39,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:39,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:13:39,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:13:39,507 INFO L87 Difference]: Start difference. First operand 50142 states and 175482 transitions. Second operand 3 states. [2019-12-07 18:13:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:39,684 INFO L93 Difference]: Finished difference Result 50142 states and 172853 transitions. [2019-12-07 18:13:39,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:13:39,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 18:13:39,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:39,768 INFO L225 Difference]: With dead ends: 50142 [2019-12-07 18:13:39,768 INFO L226 Difference]: Without dead ends: 50142 [2019-12-07 18:13:39,768 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 18:13:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50142 states. [2019-12-07 18:13:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50142 to 50009. [2019-12-07 18:13:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50009 states. [2019-12-07 18:13:40,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50009 states to 50009 states and 172484 transitions. [2019-12-07 18:13:40,795 INFO L78 Accepts]: Start accepts. Automaton has 50009 states and 172484 transitions. Word has length 33 [2019-12-07 18:13:40,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:40,795 INFO L462 AbstractCegarLoop]: Abstraction has 50009 states and 172484 transitions. [2019-12-07 18:13:40,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:13:40,795 INFO L276 IsEmpty]: Start isEmpty. Operand 50009 states and 172484 transitions. [2019-12-07 18:13:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:13:40,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:40,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:13:40,836 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:40,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:40,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1082877567, now seen corresponding path program 1 times [2019-12-07 18:13:40,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:40,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779891084] [2019-12-07 18:13:40,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:40,878 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 18:13:40,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779891084] [2019-12-07 18:13:40,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:40,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:13:40,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440468899] [2019-12-07 18:13:40,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:13:40,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:40,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:13:40,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:13:40,879 INFO L87 Difference]: Start difference. First operand 50009 states and 172484 transitions. Second operand 5 states. [2019-12-07 18:13:40,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:40,936 INFO L93 Difference]: Finished difference Result 11083 states and 34242 transitions. [2019-12-07 18:13:40,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:13:40,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 18:13:40,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:40,945 INFO L225 Difference]: With dead ends: 11083 [2019-12-07 18:13:40,945 INFO L226 Difference]: Without dead ends: 7838 [2019-12-07 18:13:40,946 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 18:13:40,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7838 states. [2019-12-07 18:13:41,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7838 to 7838. [2019-12-07 18:13:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7838 states. [2019-12-07 18:13:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7838 states to 7838 states and 22845 transitions. [2019-12-07 18:13:41,030 INFO L78 Accepts]: Start accepts. Automaton has 7838 states and 22845 transitions. Word has length 34 [2019-12-07 18:13:41,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:41,030 INFO L462 AbstractCegarLoop]: Abstraction has 7838 states and 22845 transitions. [2019-12-07 18:13:41,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:13:41,030 INFO L276 IsEmpty]: Start isEmpty. Operand 7838 states and 22845 transitions. [2019-12-07 18:13:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 18:13:41,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:41,036 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] [2019-12-07 18:13:41,036 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:41,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:41,037 INFO L82 PathProgramCache]: Analyzing trace with hash -456970203, now seen corresponding path program 1 times [2019-12-07 18:13:41,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:41,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417746510] [2019-12-07 18:13:41,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:41,246 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 18:13:41,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417746510] [2019-12-07 18:13:41,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:41,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:13:41,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164317755] [2019-12-07 18:13:41,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:13:41,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:41,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:13:41,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:13:41,247 INFO L87 Difference]: Start difference. First operand 7838 states and 22845 transitions. Second operand 9 states. [2019-12-07 18:13:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:42,113 INFO L93 Difference]: Finished difference Result 14947 states and 39736 transitions. [2019-12-07 18:13:42,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:13:42,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2019-12-07 18:13:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:42,127 INFO L225 Difference]: With dead ends: 14947 [2019-12-07 18:13:42,127 INFO L226 Difference]: Without dead ends: 14315 [2019-12-07 18:13:42,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:13:42,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14315 states. [2019-12-07 18:13:42,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14315 to 10550. [2019-12-07 18:13:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10550 states. [2019-12-07 18:13:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10550 states to 10550 states and 29695 transitions. [2019-12-07 18:13:42,264 INFO L78 Accepts]: Start accepts. Automaton has 10550 states and 29695 transitions. Word has length 46 [2019-12-07 18:13:42,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:42,264 INFO L462 AbstractCegarLoop]: Abstraction has 10550 states and 29695 transitions. [2019-12-07 18:13:42,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:13:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 10550 states and 29695 transitions. [2019-12-07 18:13:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 18:13:42,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:42,273 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] [2019-12-07 18:13:42,273 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:42,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:42,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1047489597, now seen corresponding path program 2 times [2019-12-07 18:13:42,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:42,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540868338] [2019-12-07 18:13:42,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:42,357 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 18:13:42,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540868338] [2019-12-07 18:13:42,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:42,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:13:42,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977129172] [2019-12-07 18:13:42,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:13:42,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:42,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:13:42,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:13:42,358 INFO L87 Difference]: Start difference. First operand 10550 states and 29695 transitions. Second operand 6 states. [2019-12-07 18:13:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:42,420 INFO L93 Difference]: Finished difference Result 8664 states and 25309 transitions. [2019-12-07 18:13:42,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:13:42,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-07 18:13:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:42,428 INFO L225 Difference]: With dead ends: 8664 [2019-12-07 18:13:42,428 INFO L226 Difference]: Without dead ends: 7391 [2019-12-07 18:13:42,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:13:42,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7391 states. [2019-12-07 18:13:42,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7391 to 6900. [2019-12-07 18:13:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6900 states. [2019-12-07 18:13:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6900 states to 6900 states and 19932 transitions. [2019-12-07 18:13:42,507 INFO L78 Accepts]: Start accepts. Automaton has 6900 states and 19932 transitions. Word has length 46 [2019-12-07 18:13:42,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:42,507 INFO L462 AbstractCegarLoop]: Abstraction has 6900 states and 19932 transitions. [2019-12-07 18:13:42,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:13:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 6900 states and 19932 transitions. [2019-12-07 18:13:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 18:13:42,513 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:42,513 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:13:42,513 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:42,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash 453990679, now seen corresponding path program 1 times [2019-12-07 18:13:42,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:42,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892710583] [2019-12-07 18:13:42,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:42,695 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 18:13:42,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892710583] [2019-12-07 18:13:42,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:42,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:13:42,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253041011] [2019-12-07 18:13:42,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:13:42,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:42,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:13:42,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:13:42,697 INFO L87 Difference]: Start difference. First operand 6900 states and 19932 transitions. Second operand 13 states. [2019-12-07 18:13:43,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:43,529 INFO L93 Difference]: Finished difference Result 17570 states and 50842 transitions. [2019-12-07 18:13:43,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:13:43,530 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-12-07 18:13:43,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:43,540 INFO L225 Difference]: With dead ends: 17570 [2019-12-07 18:13:43,540 INFO L226 Difference]: Without dead ends: 10429 [2019-12-07 18:13:43,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2019-12-07 18:13:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10429 states. [2019-12-07 18:13:43,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10429 to 7349. [2019-12-07 18:13:43,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7349 states. [2019-12-07 18:13:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7349 states to 7349 states and 20958 transitions. [2019-12-07 18:13:43,638 INFO L78 Accepts]: Start accepts. Automaton has 7349 states and 20958 transitions. Word has length 62 [2019-12-07 18:13:43,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:43,638 INFO L462 AbstractCegarLoop]: Abstraction has 7349 states and 20958 transitions. [2019-12-07 18:13:43,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:13:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 7349 states and 20958 transitions. [2019-12-07 18:13:43,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 18:13:43,644 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:43,644 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:13:43,644 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:43,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:43,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1098348301, now seen corresponding path program 2 times [2019-12-07 18:13:43,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:43,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472256156] [2019-12-07 18:13:43,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:43,837 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 18:13:43,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472256156] [2019-12-07 18:13:43,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:43,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:13:43,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146724507] [2019-12-07 18:13:43,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:13:43,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:43,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:13:43,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:13:43,839 INFO L87 Difference]: Start difference. First operand 7349 states and 20958 transitions. Second operand 10 states. [2019-12-07 18:13:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:45,359 INFO L93 Difference]: Finished difference Result 21990 states and 60788 transitions. [2019-12-07 18:13:45,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 18:13:45,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-12-07 18:13:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:45,389 INFO L225 Difference]: With dead ends: 21990 [2019-12-07 18:13:45,389 INFO L226 Difference]: Without dead ends: 18603 [2019-12-07 18:13:45,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:13:45,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18603 states. [2019-12-07 18:13:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18603 to 9677. [2019-12-07 18:13:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9677 states. [2019-12-07 18:13:45,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9677 states to 9677 states and 29052 transitions. [2019-12-07 18:13:45,558 INFO L78 Accepts]: Start accepts. Automaton has 9677 states and 29052 transitions. Word has length 62 [2019-12-07 18:13:45,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:45,558 INFO L462 AbstractCegarLoop]: Abstraction has 9677 states and 29052 transitions. [2019-12-07 18:13:45,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:13:45,558 INFO L276 IsEmpty]: Start isEmpty. Operand 9677 states and 29052 transitions. [2019-12-07 18:13:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 18:13:45,566 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:45,567 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:13:45,567 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:45,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:45,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1432634509, now seen corresponding path program 1 times [2019-12-07 18:13:45,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:45,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35331196] [2019-12-07 18:13:45,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:45,631 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 18:13:45,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35331196] [2019-12-07 18:13:45,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:45,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:13:45,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813824628] [2019-12-07 18:13:45,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:13:45,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:45,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:13:45,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:13:45,632 INFO L87 Difference]: Start difference. First operand 9677 states and 29052 transitions. Second operand 5 states. [2019-12-07 18:13:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:45,674 INFO L93 Difference]: Finished difference Result 10490 states and 30900 transitions. [2019-12-07 18:13:45,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:13:45,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 18:13:45,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:45,681 INFO L225 Difference]: With dead ends: 10490 [2019-12-07 18:13:45,681 INFO L226 Difference]: Without dead ends: 5054 [2019-12-07 18:13:45,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 18:13:45,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5054 states. [2019-12-07 18:13:45,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5054 to 5054. [2019-12-07 18:13:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5054 states. [2019-12-07 18:13:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5054 states to 5054 states and 13459 transitions. [2019-12-07 18:13:45,733 INFO L78 Accepts]: Start accepts. Automaton has 5054 states and 13459 transitions. Word has length 63 [2019-12-07 18:13:45,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:45,733 INFO L462 AbstractCegarLoop]: Abstraction has 5054 states and 13459 transitions. [2019-12-07 18:13:45,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:13:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 5054 states and 13459 transitions. [2019-12-07 18:13:45,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 18:13:45,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:45,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:13:45,737 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:45,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:45,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1383656085, now seen corresponding path program 2 times [2019-12-07 18:13:45,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:45,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916779063] [2019-12-07 18:13:45,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:45,923 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 18:13:45,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916779063] [2019-12-07 18:13:45,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:45,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:13:45,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331015683] [2019-12-07 18:13:45,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:13:45,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:45,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:13:45,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:13:45,924 INFO L87 Difference]: Start difference. First operand 5054 states and 13459 transitions. Second operand 12 states. [2019-12-07 18:13:47,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:47,605 INFO L93 Difference]: Finished difference Result 12855 states and 34225 transitions. [2019-12-07 18:13:47,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 18:13:47,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-12-07 18:13:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:47,614 INFO L225 Difference]: With dead ends: 12855 [2019-12-07 18:13:47,614 INFO L226 Difference]: Without dead ends: 10555 [2019-12-07 18:13:47,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 18:13:47,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10555 states. [2019-12-07 18:13:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10555 to 7700. [2019-12-07 18:13:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7700 states. [2019-12-07 18:13:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7700 states to 7700 states and 20547 transitions. [2019-12-07 18:13:47,711 INFO L78 Accepts]: Start accepts. Automaton has 7700 states and 20547 transitions. Word has length 63 [2019-12-07 18:13:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:47,711 INFO L462 AbstractCegarLoop]: Abstraction has 7700 states and 20547 transitions. [2019-12-07 18:13:47,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:13:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 7700 states and 20547 transitions. [2019-12-07 18:13:47,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 18:13:47,716 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:47,717 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:13:47,717 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:47,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:47,717 INFO L82 PathProgramCache]: Analyzing trace with hash 929169187, now seen corresponding path program 3 times [2019-12-07 18:13:47,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:47,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908112861] [2019-12-07 18:13:47,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:47,791 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 18:13:47,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908112861] [2019-12-07 18:13:47,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:47,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:13:47,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420417776] [2019-12-07 18:13:47,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:13:47,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:47,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:13:47,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:13:47,793 INFO L87 Difference]: Start difference. First operand 7700 states and 20547 transitions. Second operand 5 states. [2019-12-07 18:13:47,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:47,842 INFO L93 Difference]: Finished difference Result 8109 states and 21481 transitions. [2019-12-07 18:13:47,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:13:47,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 18:13:47,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:47,843 INFO L225 Difference]: With dead ends: 8109 [2019-12-07 18:13:47,843 INFO L226 Difference]: Without dead ends: 515 [2019-12-07 18:13:47,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:13:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-12-07 18:13:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2019-12-07 18:13:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-12-07 18:13:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1104 transitions. [2019-12-07 18:13:47,847 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1104 transitions. Word has length 63 [2019-12-07 18:13:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:47,848 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 1104 transitions. [2019-12-07 18:13:47,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:13:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1104 transitions. [2019-12-07 18:13:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 18:13:47,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:47,848 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:13:47,848 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:47,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:47,849 INFO L82 PathProgramCache]: Analyzing trace with hash -692797329, now seen corresponding path program 4 times [2019-12-07 18:13:47,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:47,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215433185] [2019-12-07 18:13:47,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:13:48,015 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 18:13:48,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215433185] [2019-12-07 18:13:48,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:13:48,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:13:48,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191667409] [2019-12-07 18:13:48,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:13:48,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:13:48,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:13:48,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:13:48,016 INFO L87 Difference]: Start difference. First operand 515 states and 1104 transitions. Second operand 12 states. [2019-12-07 18:13:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:13:48,659 INFO L93 Difference]: Finished difference Result 1189 states and 2569 transitions. [2019-12-07 18:13:48,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 18:13:48,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-12-07 18:13:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:13:48,661 INFO L225 Difference]: With dead ends: 1189 [2019-12-07 18:13:48,661 INFO L226 Difference]: Without dead ends: 890 [2019-12-07 18:13:48,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:13:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-12-07 18:13:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 546. [2019-12-07 18:13:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-12-07 18:13:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1152 transitions. [2019-12-07 18:13:48,667 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1152 transitions. Word has length 63 [2019-12-07 18:13:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:13:48,667 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 1152 transitions. [2019-12-07 18:13:48,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:13:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1152 transitions. [2019-12-07 18:13:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 18:13:48,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:13:48,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, 1, 1, 1, 1, 1] [2019-12-07 18:13:48,668 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:13:48,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:13:48,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1081093091, now seen corresponding path program 5 times [2019-12-07 18:13:48,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:13:48,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60654733] [2019-12-07 18:13:48,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:13:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:13:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:13:48,750 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:13:48,750 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:13:48,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_148| 0 0))) (and (= v_~z$r_buff0_thd1~0_163 0) (= v_~z$r_buff1_thd1~0_231 0) (= 0 v_~__unbuffered_p2_EAX~0_94) (= v_~weak$$choice2~0_336 0) (= v_~z$r_buff1_thd2~0_450 0) (= v_~main$tmp_guard0~0_29 0) (= v_~z$w_buff0~0_389 0) (= v_~main$tmp_guard1~0_78 0) (= v_~y~0_48 0) (< 0 |v_#StackHeapBarrier_17|) (= |v_#valid_146| (store .cse0 |v_ULTIMATE.start_main_~#t400~0.base_114| 1)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t400~0.base_114|) (= (select .cse0 |v_ULTIMATE.start_main_~#t400~0.base_114|) 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~z$w_buff1~0_275 0) (= 0 v_~z$r_buff0_thd3~0_641) (= |v_ULTIMATE.start_main_~#t400~0.offset_64| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t400~0.base_114| 4)) (= 0 v_~__unbuffered_p1_EAX~0_94) (= v_~__unbuffered_cnt~0_142 0) (= v_~z$w_buff1_used~0_552 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_338 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= v_~z$r_buff0_thd0~0_222 0) (= 0 v_~weak$$choice0~0_260) (= |v_#NULL.offset_5| 0) (= v_~z~0_393 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~__unbuffered_p2_EBX~0_87 0) (= v_~z$r_buff0_thd2~0_459 0) (= v_~a~0_33 0) (= 0 v_~z$flush_delayed~0_341) (= 0 v_~z$mem_tmp~0_277) (= v_~x~0_19 0) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff0_used~0_978 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t400~0.base_114| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t400~0.base_114|) |v_ULTIMATE.start_main_~#t400~0.offset_64| 0)) |v_#memory_int_21|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_16|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_~#t402~0.offset=|v_ULTIMATE.start_main_~#t402~0.offset_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_450, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_33, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_222, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_94, #length=|v_#length_25|, ULTIMATE.start_main_~#t402~0.base=|v_ULTIMATE.start_main_~#t402~0.base_63|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_94, ~z$mem_tmp~0=v_~z$mem_tmp~0_277, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_87, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ULTIMATE.start_main_~#t400~0.offset=|v_ULTIMATE.start_main_~#t400~0.offset_64|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_552, ~z$flush_delayed~0=v_~z$flush_delayed~0_341, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_159|, ~weak$$choice0~0=v_~weak$$choice0~0_260, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_231, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_641, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ~x~0=v_~x~0_19, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_78, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t400~0.base=|v_ULTIMATE.start_main_~#t400~0.base_114|, ULTIMATE.start_main_~#t401~0.offset=|v_ULTIMATE.start_main_~#t401~0.offset_38|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_338, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_459, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_978, ~z$w_buff0~0=v_~z$w_buff0~0_389, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_88|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_371|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_63|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_393, ULTIMATE.start_main_~#t401~0.base=|v_ULTIMATE.start_main_~#t401~0.base_87|, ~weak$$choice2~0=v_~weak$$choice2~0_336, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_163} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t402~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t402~0.base, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t400~0.offset, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t400~0.base, ULTIMATE.start_main_~#t401~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t401~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:13:48,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L840-1-->L842: Formula: (and (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t401~0.base_11|)) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t401~0.base_11| 1) |v_#valid_34|) (not (= 0 |v_ULTIMATE.start_main_~#t401~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t401~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t401~0.base_11|) (= |v_ULTIMATE.start_main_~#t401~0.offset_10| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t401~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t401~0.base_11|) |v_ULTIMATE.start_main_~#t401~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t401~0.offset=|v_ULTIMATE.start_main_~#t401~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t401~0.base=|v_ULTIMATE.start_main_~#t401~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t401~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t401~0.base] because there is no mapped edge [2019-12-07 18:13:48,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L842-1-->L844: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t402~0.base_11| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t402~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t402~0.base_11|) |v_ULTIMATE.start_main_~#t402~0.offset_10| 2))) (= |v_ULTIMATE.start_main_~#t402~0.offset_10| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t402~0.base_11| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t402~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t402~0.base_11|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t402~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t402~0.offset=|v_ULTIMATE.start_main_~#t402~0.offset_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t402~0.base=|v_ULTIMATE.start_main_~#t402~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t402~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t402~0.base, #length] because there is no mapped edge [2019-12-07 18:13:48,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] P2ENTRY-->L4-3: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69)) (= v_~z$w_buff0_used~0_347 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_67) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_200 256) 0)) (not (= (mod v_~z$w_buff0_used~0_347 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~z$w_buff0_used~0_348 v_~z$w_buff1_used~0_200) (= v_~z$w_buff0~0_158 v_~z$w_buff1~0_95) (= v_~z$w_buff0~0_157 1) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_67)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_348, ~z$w_buff0~0=v_~z$w_buff0~0_158, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_347, ~z$w_buff0~0=v_~z$w_buff0~0_157, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_200, ~z$w_buff1~0=v_~z$w_buff1~0_95, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 18:13:48,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1818530588 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1818530588 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1818530588| ~z$w_buff1~0_In-1818530588) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1818530588| ~z$w_buff0~0_In-1818530588) (not .cse0) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1818530588, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1818530588, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1818530588, ~z$w_buff1~0=~z$w_buff1~0_In-1818530588} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1818530588|, ~z$w_buff0~0=~z$w_buff0~0_In-1818530588, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1818530588, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1818530588, ~z$w_buff1~0=~z$w_buff1~0_In-1818530588} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 18:13:48,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L802-4-->L803: Formula: (= v_~z~0_26 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, ~z~0=v_~z~0_26, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 18:13:48,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L807-->L808: Formula: (and (not (= (mod v_~weak$$choice2~0_43 256) 0)) (= v_~z$r_buff0_thd3~0_66 v_~z$r_buff0_thd3~0_65)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_43} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_43} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 18:13:48,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-950306637 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-950306637| ~z~0_In-950306637)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out-950306637| ~z$mem_tmp~0_In-950306637) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-950306637, ~z$flush_delayed~0=~z$flush_delayed~0_In-950306637, ~z~0=~z~0_In-950306637} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-950306637|, ~z$mem_tmp~0=~z$mem_tmp~0_In-950306637, ~z$flush_delayed~0=~z$flush_delayed~0_In-950306637, ~z~0=~z~0_In-950306637} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 18:13:48,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_10 |v_P0Thread1of1ForFork1_#in~arg.offset_12|) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= |v_P0Thread1of1ForFork1_#in~arg.base_12| v_P0Thread1of1ForFork1_~arg.base_10) (= v_~__unbuffered_p0_EBX~0_19 v_~y~0_40) (= v_~x~0_13 v_~__unbuffered_p0_EAX~0_19) (= v_~x~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~a~0_17 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_12|, ~y~0=v_~y~0_40} OutVars{~a~0=v_~a~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_12|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_12|, ~y~0=v_~y~0_40, ~x~0=v_~x~0_13, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 18:13:48,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-757813157 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-757813157 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-757813157|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-757813157 |P2Thread1of1ForFork0_#t~ite51_Out-757813157|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-757813157, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-757813157} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-757813157, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-757813157, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-757813157|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 18:13:48,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1338209458 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1338209458 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1338209458 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1338209458 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1338209458| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1338209458| ~z$w_buff1_used~0_In-1338209458) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1338209458, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1338209458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1338209458, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1338209458} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1338209458, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1338209458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1338209458, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1338209458|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1338209458} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 18:13:48,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L820-->L821: Formula: (let ((.cse1 (= ~z$r_buff0_thd3~0_Out-481186608 ~z$r_buff0_thd3~0_In-481186608)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-481186608 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-481186608 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse2) (not .cse0) (= ~z$r_buff0_thd3~0_Out-481186608 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-481186608, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-481186608} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-481186608, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-481186608, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-481186608|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 18:13:48,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1059102149 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In1059102149 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1059102149 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1059102149 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out1059102149| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite54_Out1059102149| ~z$r_buff1_thd3~0_In1059102149) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1059102149, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1059102149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1059102149, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1059102149} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1059102149, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1059102149|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1059102149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1059102149, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1059102149} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 18:13:48,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1)) (= v_~z$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite54_36|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 18:13:48,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1004437143 256) 0))) (or (and .cse0 (= ~z~0_In-1004437143 |P1Thread1of1ForFork2_#t~ite25_Out-1004437143|)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out-1004437143| ~z$mem_tmp~0_In-1004437143)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1004437143, ~z$flush_delayed~0=~z$flush_delayed~0_In-1004437143, ~z~0=~z~0_In-1004437143} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1004437143, ~z$flush_delayed~0=~z$flush_delayed~0_In-1004437143, ~z~0=~z~0_In-1004437143, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1004437143|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:13:48,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~z~0_239 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= 0 v_~z$flush_delayed~0_267) (= v_~__unbuffered_cnt~0_117 (+ v_~__unbuffered_cnt~0_118 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~z$flush_delayed~0=v_~z$flush_delayed~0_267, ~z~0=v_~z~0_239, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:13:48,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [897] [897] L848-->L850-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~z$r_buff0_thd0~0_30 256) 0) (= 0 (mod v_~z$w_buff0_used~0_165 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:13:48,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L850-2-->L850-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In28937115 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In28937115 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out28937115| |ULTIMATE.start_main_#t~ite58_Out28937115|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite58_Out28937115| ~z$w_buff1~0_In28937115) (not .cse1) .cse2) (and (or .cse0 .cse1) .cse2 (= ~z~0_In28937115 |ULTIMATE.start_main_#t~ite58_Out28937115|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In28937115, ~z$w_buff1_used~0=~z$w_buff1_used~0_In28937115, ~z$w_buff1~0=~z$w_buff1~0_In28937115, ~z~0=~z~0_In28937115} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In28937115, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out28937115|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In28937115, ~z$w_buff1~0=~z$w_buff1~0_In28937115, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out28937115|, ~z~0=~z~0_In28937115} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:13:48,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In168809869 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In168809869 256)))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out168809869| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite60_Out168809869| ~z$w_buff0_used~0_In168809869)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In168809869, ~z$w_buff0_used~0=~z$w_buff0_used~0_In168809869} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out168809869|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In168809869, ~z$w_buff0_used~0=~z$w_buff0_used~0_In168809869} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 18:13:48,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In76531471 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In76531471 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In76531471 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In76531471 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite61_Out76531471| ~z$w_buff1_used~0_In76531471)) (and (= |ULTIMATE.start_main_#t~ite61_Out76531471| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In76531471, ~z$w_buff0_used~0=~z$w_buff0_used~0_In76531471, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In76531471, ~z$w_buff1_used~0=~z$w_buff1_used~0_In76531471} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In76531471, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out76531471|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In76531471, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In76531471, ~z$w_buff1_used~0=~z$w_buff1_used~0_In76531471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:13:48,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1342279145 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1342279145 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out-1342279145| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1342279145 |ULTIMATE.start_main_#t~ite62_Out-1342279145|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1342279145, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1342279145} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1342279145|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1342279145, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1342279145} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:13:48,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In912167112 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In912167112 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In912167112 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In912167112 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out912167112|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In912167112 |ULTIMATE.start_main_#t~ite63_Out912167112|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In912167112, ~z$w_buff0_used~0=~z$w_buff0_used~0_In912167112, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In912167112, ~z$w_buff1_used~0=~z$w_buff1_used~0_In912167112} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out912167112|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In912167112, ~z$w_buff0_used~0=~z$w_buff0_used~0_In912167112, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In912167112, ~z$w_buff1_used~0=~z$w_buff1_used~0_In912167112} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:13:48,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_22 256)) (= v_~z$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= v_~main$tmp_guard1~0_22 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_30) (= v_~__unbuffered_p2_EBX~0_26 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 1 v_~__unbuffered_p2_EAX~0_22))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:13:48,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:13:48 BasicIcfg [2019-12-07 18:13:48,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:13:48,840 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:13:48,841 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:13:48,841 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:13:48,841 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:13:13" (3/4) ... [2019-12-07 18:13:48,843 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:13:48,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_148| 0 0))) (and (= v_~z$r_buff0_thd1~0_163 0) (= v_~z$r_buff1_thd1~0_231 0) (= 0 v_~__unbuffered_p2_EAX~0_94) (= v_~weak$$choice2~0_336 0) (= v_~z$r_buff1_thd2~0_450 0) (= v_~main$tmp_guard0~0_29 0) (= v_~z$w_buff0~0_389 0) (= v_~main$tmp_guard1~0_78 0) (= v_~y~0_48 0) (< 0 |v_#StackHeapBarrier_17|) (= |v_#valid_146| (store .cse0 |v_ULTIMATE.start_main_~#t400~0.base_114| 1)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t400~0.base_114|) (= (select .cse0 |v_ULTIMATE.start_main_~#t400~0.base_114|) 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~z$w_buff1~0_275 0) (= 0 v_~z$r_buff0_thd3~0_641) (= |v_ULTIMATE.start_main_~#t400~0.offset_64| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t400~0.base_114| 4)) (= 0 v_~__unbuffered_p1_EAX~0_94) (= v_~__unbuffered_cnt~0_142 0) (= v_~z$w_buff1_used~0_552 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_338 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= v_~z$r_buff0_thd0~0_222 0) (= 0 v_~weak$$choice0~0_260) (= |v_#NULL.offset_5| 0) (= v_~z~0_393 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~__unbuffered_p2_EBX~0_87 0) (= v_~z$r_buff0_thd2~0_459 0) (= v_~a~0_33 0) (= 0 v_~z$flush_delayed~0_341) (= 0 v_~z$mem_tmp~0_277) (= v_~x~0_19 0) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff0_used~0_978 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t400~0.base_114| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t400~0.base_114|) |v_ULTIMATE.start_main_~#t400~0.offset_64| 0)) |v_#memory_int_21|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_16|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_~#t402~0.offset=|v_ULTIMATE.start_main_~#t402~0.offset_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_450, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_33, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_222, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_94, #length=|v_#length_25|, ULTIMATE.start_main_~#t402~0.base=|v_ULTIMATE.start_main_~#t402~0.base_63|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_94, ~z$mem_tmp~0=v_~z$mem_tmp~0_277, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_87, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ULTIMATE.start_main_~#t400~0.offset=|v_ULTIMATE.start_main_~#t400~0.offset_64|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_552, ~z$flush_delayed~0=v_~z$flush_delayed~0_341, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_159|, ~weak$$choice0~0=v_~weak$$choice0~0_260, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_231, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_641, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ~x~0=v_~x~0_19, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_78, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t400~0.base=|v_ULTIMATE.start_main_~#t400~0.base_114|, ULTIMATE.start_main_~#t401~0.offset=|v_ULTIMATE.start_main_~#t401~0.offset_38|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_338, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_459, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_978, ~z$w_buff0~0=v_~z$w_buff0~0_389, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_88|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_371|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_63|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_393, ULTIMATE.start_main_~#t401~0.base=|v_ULTIMATE.start_main_~#t401~0.base_87|, ~weak$$choice2~0=v_~weak$$choice2~0_336, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_163} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t402~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t402~0.base, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t400~0.offset, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t400~0.base, ULTIMATE.start_main_~#t401~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t401~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:13:48,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L840-1-->L842: Formula: (and (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t401~0.base_11|)) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t401~0.base_11| 1) |v_#valid_34|) (not (= 0 |v_ULTIMATE.start_main_~#t401~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t401~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t401~0.base_11|) (= |v_ULTIMATE.start_main_~#t401~0.offset_10| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t401~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t401~0.base_11|) |v_ULTIMATE.start_main_~#t401~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t401~0.offset=|v_ULTIMATE.start_main_~#t401~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t401~0.base=|v_ULTIMATE.start_main_~#t401~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t401~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t401~0.base] because there is no mapped edge [2019-12-07 18:13:48,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L842-1-->L844: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t402~0.base_11| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t402~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t402~0.base_11|) |v_ULTIMATE.start_main_~#t402~0.offset_10| 2))) (= |v_ULTIMATE.start_main_~#t402~0.offset_10| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t402~0.base_11| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t402~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t402~0.base_11|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t402~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t402~0.offset=|v_ULTIMATE.start_main_~#t402~0.offset_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t402~0.base=|v_ULTIMATE.start_main_~#t402~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t402~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t402~0.base, #length] because there is no mapped edge [2019-12-07 18:13:48,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] P2ENTRY-->L4-3: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69)) (= v_~z$w_buff0_used~0_347 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_67) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_200 256) 0)) (not (= (mod v_~z$w_buff0_used~0_347 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~z$w_buff0_used~0_348 v_~z$w_buff1_used~0_200) (= v_~z$w_buff0~0_158 v_~z$w_buff1~0_95) (= v_~z$w_buff0~0_157 1) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_67)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_348, ~z$w_buff0~0=v_~z$w_buff0~0_158, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_347, ~z$w_buff0~0=v_~z$w_buff0~0_157, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_200, ~z$w_buff1~0=v_~z$w_buff1~0_95, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 18:13:48,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1818530588 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1818530588 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1818530588| ~z$w_buff1~0_In-1818530588) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1818530588| ~z$w_buff0~0_In-1818530588) (not .cse0) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1818530588, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1818530588, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1818530588, ~z$w_buff1~0=~z$w_buff1~0_In-1818530588} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1818530588|, ~z$w_buff0~0=~z$w_buff0~0_In-1818530588, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1818530588, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1818530588, ~z$w_buff1~0=~z$w_buff1~0_In-1818530588} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 18:13:48,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L802-4-->L803: Formula: (= v_~z~0_26 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, ~z~0=v_~z~0_26, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 18:13:48,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L807-->L808: Formula: (and (not (= (mod v_~weak$$choice2~0_43 256) 0)) (= v_~z$r_buff0_thd3~0_66 v_~z$r_buff0_thd3~0_65)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_43} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_43} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 18:13:48,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-950306637 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-950306637| ~z~0_In-950306637)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out-950306637| ~z$mem_tmp~0_In-950306637) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-950306637, ~z$flush_delayed~0=~z$flush_delayed~0_In-950306637, ~z~0=~z~0_In-950306637} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-950306637|, ~z$mem_tmp~0=~z$mem_tmp~0_In-950306637, ~z$flush_delayed~0=~z$flush_delayed~0_In-950306637, ~z~0=~z~0_In-950306637} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 18:13:48,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_10 |v_P0Thread1of1ForFork1_#in~arg.offset_12|) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= |v_P0Thread1of1ForFork1_#in~arg.base_12| v_P0Thread1of1ForFork1_~arg.base_10) (= v_~__unbuffered_p0_EBX~0_19 v_~y~0_40) (= v_~x~0_13 v_~__unbuffered_p0_EAX~0_19) (= v_~x~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~a~0_17 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_12|, ~y~0=v_~y~0_40} OutVars{~a~0=v_~a~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_12|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_12|, ~y~0=v_~y~0_40, ~x~0=v_~x~0_13, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 18:13:48,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-757813157 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-757813157 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-757813157|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-757813157 |P2Thread1of1ForFork0_#t~ite51_Out-757813157|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-757813157, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-757813157} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-757813157, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-757813157, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-757813157|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 18:13:48,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1338209458 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1338209458 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1338209458 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1338209458 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1338209458| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1338209458| ~z$w_buff1_used~0_In-1338209458) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1338209458, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1338209458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1338209458, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1338209458} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1338209458, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1338209458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1338209458, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1338209458|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1338209458} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 18:13:48,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L820-->L821: Formula: (let ((.cse1 (= ~z$r_buff0_thd3~0_Out-481186608 ~z$r_buff0_thd3~0_In-481186608)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-481186608 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-481186608 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse2) (not .cse0) (= ~z$r_buff0_thd3~0_Out-481186608 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-481186608, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-481186608} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-481186608, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-481186608, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-481186608|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 18:13:48,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1059102149 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In1059102149 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1059102149 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1059102149 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out1059102149| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite54_Out1059102149| ~z$r_buff1_thd3~0_In1059102149) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1059102149, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1059102149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1059102149, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1059102149} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1059102149, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1059102149|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1059102149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1059102149, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1059102149} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 18:13:48,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1)) (= v_~z$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite54_36|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 18:13:48,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1004437143 256) 0))) (or (and .cse0 (= ~z~0_In-1004437143 |P1Thread1of1ForFork2_#t~ite25_Out-1004437143|)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out-1004437143| ~z$mem_tmp~0_In-1004437143)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1004437143, ~z$flush_delayed~0=~z$flush_delayed~0_In-1004437143, ~z~0=~z~0_In-1004437143} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1004437143, ~z$flush_delayed~0=~z$flush_delayed~0_In-1004437143, ~z~0=~z~0_In-1004437143, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1004437143|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:13:48,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~z~0_239 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= 0 v_~z$flush_delayed~0_267) (= v_~__unbuffered_cnt~0_117 (+ v_~__unbuffered_cnt~0_118 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~z$flush_delayed~0=v_~z$flush_delayed~0_267, ~z~0=v_~z~0_239, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:13:48,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [897] [897] L848-->L850-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~z$r_buff0_thd0~0_30 256) 0) (= 0 (mod v_~z$w_buff0_used~0_165 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:13:48,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L850-2-->L850-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In28937115 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In28937115 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out28937115| |ULTIMATE.start_main_#t~ite58_Out28937115|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite58_Out28937115| ~z$w_buff1~0_In28937115) (not .cse1) .cse2) (and (or .cse0 .cse1) .cse2 (= ~z~0_In28937115 |ULTIMATE.start_main_#t~ite58_Out28937115|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In28937115, ~z$w_buff1_used~0=~z$w_buff1_used~0_In28937115, ~z$w_buff1~0=~z$w_buff1~0_In28937115, ~z~0=~z~0_In28937115} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In28937115, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out28937115|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In28937115, ~z$w_buff1~0=~z$w_buff1~0_In28937115, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out28937115|, ~z~0=~z~0_In28937115} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:13:48,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In168809869 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In168809869 256)))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out168809869| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite60_Out168809869| ~z$w_buff0_used~0_In168809869)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In168809869, ~z$w_buff0_used~0=~z$w_buff0_used~0_In168809869} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out168809869|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In168809869, ~z$w_buff0_used~0=~z$w_buff0_used~0_In168809869} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 18:13:48,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In76531471 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In76531471 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In76531471 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In76531471 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite61_Out76531471| ~z$w_buff1_used~0_In76531471)) (and (= |ULTIMATE.start_main_#t~ite61_Out76531471| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In76531471, ~z$w_buff0_used~0=~z$w_buff0_used~0_In76531471, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In76531471, ~z$w_buff1_used~0=~z$w_buff1_used~0_In76531471} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In76531471, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out76531471|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In76531471, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In76531471, ~z$w_buff1_used~0=~z$w_buff1_used~0_In76531471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:13:48,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1342279145 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1342279145 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out-1342279145| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1342279145 |ULTIMATE.start_main_#t~ite62_Out-1342279145|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1342279145, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1342279145} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1342279145|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1342279145, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1342279145} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:13:48,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In912167112 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In912167112 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In912167112 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In912167112 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out912167112|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In912167112 |ULTIMATE.start_main_#t~ite63_Out912167112|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In912167112, ~z$w_buff0_used~0=~z$w_buff0_used~0_In912167112, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In912167112, ~z$w_buff1_used~0=~z$w_buff1_used~0_In912167112} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out912167112|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In912167112, ~z$w_buff0_used~0=~z$w_buff0_used~0_In912167112, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In912167112, ~z$w_buff1_used~0=~z$w_buff1_used~0_In912167112} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:13:48,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_22 256)) (= v_~z$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= v_~main$tmp_guard1~0_22 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_30) (= v_~__unbuffered_p2_EBX~0_26 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 1 v_~__unbuffered_p2_EAX~0_22))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:13:48,915 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_56a24975-8ab2-4157-9ad3-6d7c3fede961/bin/uautomizer/witness.graphml [2019-12-07 18:13:48,915 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:13:48,916 INFO L168 Benchmark]: Toolchain (without parser) took 36402.36 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 940.9 MB in the beginning and 1.6 GB in the end (delta: -698.6 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-12-07 18:13:48,917 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:13:48,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:13:48,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:13:48,917 INFO L168 Benchmark]: Boogie Preprocessor took 28.37 ms. Allocated memory is still 1.2 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 18:13:48,918 INFO L168 Benchmark]: RCFGBuilder took 442.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:13:48,918 INFO L168 Benchmark]: TraceAbstraction took 35349.59 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -664.4 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-12-07 18:13:48,918 INFO L168 Benchmark]: Witness Printer took 74.92 ms. Allocated memory is still 4.6 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 53.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:13:48,919 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 461.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.37 ms. Allocated memory is still 1.2 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 442.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35349.59 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -664.4 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 74.92 ms. Allocated memory is still 4.6 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 53.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 197 ProgramPointsBefore, 108 ProgramPointsAfterwards, 243 TransitionsBefore, 130 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 28 ChoiceCompositions, 9454 VarBasedMoverChecksPositive, 317 VarBasedMoverChecksNegative, 92 SemBasedMoverChecksPositive, 331 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 124397 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t400, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t401, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] FCALL, FORK 0 pthread_create(&t402, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L792] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L793] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L794] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L795] 3 z$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 y = 1 [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 35.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4316 SDtfs, 7140 SDslu, 11179 SDs, 0 SdLazy, 6348 SolverSat, 317 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 32 SyntacticMatches, 9 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73414occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 43509 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 758 NumberOfCodeBlocks, 758 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 677 ConstructedInterpolants, 0 QuantifiedInterpolants, 259637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...