./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_tso.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_5e3b6f35-80f7-438e-9134-802c4fc301d3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5e3b6f35-80f7-438e-9134-802c4fc301d3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5e3b6f35-80f7-438e-9134-802c4fc301d3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5e3b6f35-80f7-438e-9134-802c4fc301d3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5e3b6f35-80f7-438e-9134-802c4fc301d3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5e3b6f35-80f7-438e-9134-802c4fc301d3/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 a02d6b34f153beaa9e9eac4f5ac19280cae90251 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:37:21,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:37:21,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:37:21,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:37:21,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:37:21,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:37:21,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:37:21,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:37:21,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:37:21,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:37:21,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:37:21,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:37:21,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:37:21,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:37:21,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:37:21,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:37:21,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:37:21,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:37:21,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:37:21,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:37:21,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:37:21,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:37:21,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:37:21,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:37:21,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:37:21,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:37:21,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:37:21,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:37:21,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:37:21,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:37:21,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:37:21,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:37:21,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:37:21,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:37:21,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:37:21,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:37:21,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:37:21,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:37:21,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:37:21,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:37:21,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:37:21,531 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5e3b6f35-80f7-438e-9134-802c4fc301d3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:37:21,543 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:37:21,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:37:21,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:37:21,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:37:21,545 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:37:21,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:37:21,545 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:37:21,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:37:21,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:37:21,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:37:21,546 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:37:21,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:37:21,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:37:21,547 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:37:21,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:37:21,547 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:37:21,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:37:21,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:37:21,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:37:21,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:37:21,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:37:21,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:37:21,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:37:21,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:37:21,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:37:21,549 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:37:21,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:37:21,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:37:21,549 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:37:21,550 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_5e3b6f35-80f7-438e-9134-802c4fc301d3/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 -> a02d6b34f153beaa9e9eac4f5ac19280cae90251 [2019-12-07 17:37:21,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:37:21,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:37:21,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:37:21,673 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:37:21,674 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:37:21,674 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5e3b6f35-80f7-438e-9134-802c4fc301d3/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi007_tso.opt.i [2019-12-07 17:37:21,715 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5e3b6f35-80f7-438e-9134-802c4fc301d3/bin/uautomizer/data/92156804a/ee48483c1aef47f8aa2135cd0951ac72/FLAGc1de9f947 [2019-12-07 17:37:22,099 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:37:22,100 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5e3b6f35-80f7-438e-9134-802c4fc301d3/sv-benchmarks/c/pthread-wmm/rfi007_tso.opt.i [2019-12-07 17:37:22,110 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5e3b6f35-80f7-438e-9134-802c4fc301d3/bin/uautomizer/data/92156804a/ee48483c1aef47f8aa2135cd0951ac72/FLAGc1de9f947 [2019-12-07 17:37:22,118 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5e3b6f35-80f7-438e-9134-802c4fc301d3/bin/uautomizer/data/92156804a/ee48483c1aef47f8aa2135cd0951ac72 [2019-12-07 17:37:22,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:37:22,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:37:22,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:37:22,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:37:22,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:37:22,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:37:22" (1/1) ... [2019-12-07 17:37:22,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:22, skipping insertion in model container [2019-12-07 17:37:22,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:37:22" (1/1) ... [2019-12-07 17:37:22,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:37:22,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:37:22,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:37:22,412 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:37:22,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:37:22,504 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:37:22,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:22 WrapperNode [2019-12-07 17:37:22,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:37:22,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:37:22,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:37:22,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:37:22,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:22" (1/1) ... [2019-12-07 17:37:22,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:22" (1/1) ... [2019-12-07 17:37:22,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:37:22,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:37:22,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:37:22,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:37:22,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:22" (1/1) ... [2019-12-07 17:37:22,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:22" (1/1) ... [2019-12-07 17:37:22,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:22" (1/1) ... [2019-12-07 17:37:22,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:22" (1/1) ... [2019-12-07 17:37:22,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:22" (1/1) ... [2019-12-07 17:37:22,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:22" (1/1) ... [2019-12-07 17:37:22,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:22" (1/1) ... [2019-12-07 17:37:22,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:37:22,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:37:22,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:37:22,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:37:22,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5e3b6f35-80f7-438e-9134-802c4fc301d3/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:37:22,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:37:22,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:37:22,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:37:22,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:37:22,624 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:37:22,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:37:22,624 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:37:22,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:37:22,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:37:22,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:37:22,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:37:22,626 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 17:37:23,020 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:37:23,021 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:37:23,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:37:23 BoogieIcfgContainer [2019-12-07 17:37:23,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:37:23,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:37:23,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:37:23,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:37:23,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:37:22" (1/3) ... [2019-12-07 17:37:23,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b88016a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:37:23, skipping insertion in model container [2019-12-07 17:37:23,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:22" (2/3) ... [2019-12-07 17:37:23,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b88016a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:37:23, skipping insertion in model container [2019-12-07 17:37:23,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:37:23" (3/3) ... [2019-12-07 17:37:23,028 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_tso.opt.i [2019-12-07 17:37:23,034 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:37:23,034 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:37:23,039 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:37:23,040 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:37:23,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,065 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,065 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,069 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,070 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,070 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,070 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,070 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:37:23,092 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:37:23,105 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:37:23,105 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:37:23,105 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:37:23,105 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:37:23,105 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:37:23,106 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:37:23,106 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:37:23,106 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:37:23,117 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 244 transitions [2019-12-07 17:37:23,118 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-07 17:37:23,181 INFO L134 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-07 17:37:23,181 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:37:23,193 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 870 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 17:37:23,214 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-07 17:37:23,250 INFO L134 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-07 17:37:23,250 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:37:23,257 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 870 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 17:37:23,279 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 25246 [2019-12-07 17:37:23,280 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:37:26,348 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 17:37:26,436 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142511 [2019-12-07 17:37:26,436 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-07 17:37:26,438 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 137 transitions [2019-12-07 17:37:27,754 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27484 states. [2019-12-07 17:37:27,755 INFO L276 IsEmpty]: Start isEmpty. Operand 27484 states. [2019-12-07 17:37:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 17:37:27,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:27,760 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 17:37:27,760 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:27,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:27,764 INFO L82 PathProgramCache]: Analyzing trace with hash 979333444, now seen corresponding path program 1 times [2019-12-07 17:37:27,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:27,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489011922] [2019-12-07 17:37:27,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:27,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489011922] [2019-12-07 17:37:27,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:27,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:37:27,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139220463] [2019-12-07 17:37:27,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:37:27,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:27,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:37:27,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:37:27,919 INFO L87 Difference]: Start difference. First operand 27484 states. Second operand 3 states. [2019-12-07 17:37:28,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:28,279 INFO L93 Difference]: Finished difference Result 27436 states and 97226 transitions. [2019-12-07 17:37:28,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:37:28,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 17:37:28,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:28,440 INFO L225 Difference]: With dead ends: 27436 [2019-12-07 17:37:28,440 INFO L226 Difference]: Without dead ends: 26890 [2019-12-07 17:37:28,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:37:28,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26890 states. [2019-12-07 17:37:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26890 to 26890. [2019-12-07 17:37:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26890 states. [2019-12-07 17:37:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26890 states to 26890 states and 95406 transitions. [2019-12-07 17:37:29,433 INFO L78 Accepts]: Start accepts. Automaton has 26890 states and 95406 transitions. Word has length 5 [2019-12-07 17:37:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:29,434 INFO L462 AbstractCegarLoop]: Abstraction has 26890 states and 95406 transitions. [2019-12-07 17:37:29,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:37:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 26890 states and 95406 transitions. [2019-12-07 17:37:29,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:37:29,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:29,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:29,436 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:29,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:29,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1135413059, now seen corresponding path program 1 times [2019-12-07 17:37:29,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:29,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924262173] [2019-12-07 17:37:29,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:29,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924262173] [2019-12-07 17:37:29,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:29,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:37:29,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137566904] [2019-12-07 17:37:29,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:37:29,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:29,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:37:29,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:37:29,494 INFO L87 Difference]: Start difference. First operand 26890 states and 95406 transitions. Second operand 4 states. [2019-12-07 17:37:29,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:29,898 INFO L93 Difference]: Finished difference Result 43282 states and 146547 transitions. [2019-12-07 17:37:29,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:37:29,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:37:29,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:30,048 INFO L225 Difference]: With dead ends: 43282 [2019-12-07 17:37:30,048 INFO L226 Difference]: Without dead ends: 43275 [2019-12-07 17:37:30,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:37:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43275 states. [2019-12-07 17:37:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43275 to 41962. [2019-12-07 17:37:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41962 states. [2019-12-07 17:37:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41962 states to 41962 states and 143055 transitions. [2019-12-07 17:37:31,201 INFO L78 Accepts]: Start accepts. Automaton has 41962 states and 143055 transitions. Word has length 11 [2019-12-07 17:37:31,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:31,201 INFO L462 AbstractCegarLoop]: Abstraction has 41962 states and 143055 transitions. [2019-12-07 17:37:31,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:37:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 41962 states and 143055 transitions. [2019-12-07 17:37:31,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:37:31,203 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:31,204 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:31,204 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:31,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:31,204 INFO L82 PathProgramCache]: Analyzing trace with hash -217981421, now seen corresponding path program 1 times [2019-12-07 17:37:31,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:31,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81998990] [2019-12-07 17:37:31,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:31,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:31,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81998990] [2019-12-07 17:37:31,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:31,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:37:31,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397680574] [2019-12-07 17:37:31,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:37:31,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:31,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:37:31,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:37:31,246 INFO L87 Difference]: Start difference. First operand 41962 states and 143055 transitions. Second operand 4 states. [2019-12-07 17:37:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:31,565 INFO L93 Difference]: Finished difference Result 53078 states and 178895 transitions. [2019-12-07 17:37:31,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:37:31,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:37:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:31,803 INFO L225 Difference]: With dead ends: 53078 [2019-12-07 17:37:31,803 INFO L226 Difference]: Without dead ends: 53078 [2019-12-07 17:37:31,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:37:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53078 states. [2019-12-07 17:37:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53078 to 47600. [2019-12-07 17:37:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47600 states. [2019-12-07 17:37:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47600 states to 47600 states and 161707 transitions. [2019-12-07 17:37:33,061 INFO L78 Accepts]: Start accepts. Automaton has 47600 states and 161707 transitions. Word has length 11 [2019-12-07 17:37:33,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:33,062 INFO L462 AbstractCegarLoop]: Abstraction has 47600 states and 161707 transitions. [2019-12-07 17:37:33,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:37:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 47600 states and 161707 transitions. [2019-12-07 17:37:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:37:33,067 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:33,067 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:33,067 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:33,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:33,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1239203888, now seen corresponding path program 1 times [2019-12-07 17:37:33,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:33,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579198405] [2019-12-07 17:37:33,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:33,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579198405] [2019-12-07 17:37:33,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:33,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:37:33,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272053177] [2019-12-07 17:37:33,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:37:33,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:33,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:37:33,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:37:33,116 INFO L87 Difference]: Start difference. First operand 47600 states and 161707 transitions. Second operand 5 states. [2019-12-07 17:37:33,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:33,635 INFO L93 Difference]: Finished difference Result 63010 states and 210076 transitions. [2019-12-07 17:37:33,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:37:33,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 17:37:33,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:33,740 INFO L225 Difference]: With dead ends: 63010 [2019-12-07 17:37:33,740 INFO L226 Difference]: Without dead ends: 63003 [2019-12-07 17:37:33,740 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 17:37:34,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63003 states. [2019-12-07 17:37:34,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63003 to 47611. [2019-12-07 17:37:34,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47611 states. [2019-12-07 17:37:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47611 states to 47611 states and 161609 transitions. [2019-12-07 17:37:35,034 INFO L78 Accepts]: Start accepts. Automaton has 47611 states and 161609 transitions. Word has length 17 [2019-12-07 17:37:35,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:35,034 INFO L462 AbstractCegarLoop]: Abstraction has 47611 states and 161609 transitions. [2019-12-07 17:37:35,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:37:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 47611 states and 161609 transitions. [2019-12-07 17:37:35,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:37:35,051 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:35,051 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] [2019-12-07 17:37:35,051 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:35,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:35,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1918132910, now seen corresponding path program 1 times [2019-12-07 17:37:35,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:35,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675992902] [2019-12-07 17:37:35,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:35,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675992902] [2019-12-07 17:37:35,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:35,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:37:35,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047652738] [2019-12-07 17:37:35,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:37:35,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:35,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:37:35,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:37:35,102 INFO L87 Difference]: Start difference. First operand 47611 states and 161609 transitions. Second operand 4 states. [2019-12-07 17:37:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:35,136 INFO L93 Difference]: Finished difference Result 5620 states and 14074 transitions. [2019-12-07 17:37:35,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:37:35,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 17:37:35,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:35,142 INFO L225 Difference]: With dead ends: 5620 [2019-12-07 17:37:35,143 INFO L226 Difference]: Without dead ends: 4725 [2019-12-07 17:37:35,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:37:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4725 states. [2019-12-07 17:37:35,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4725 to 4725. [2019-12-07 17:37:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-12-07 17:37:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 11319 transitions. [2019-12-07 17:37:35,202 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 11319 transitions. Word has length 25 [2019-12-07 17:37:35,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:35,202 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 11319 transitions. [2019-12-07 17:37:35,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:37:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 11319 transitions. [2019-12-07 17:37:35,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:37:35,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:35,205 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] [2019-12-07 17:37:35,205 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:35,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:35,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2102045766, now seen corresponding path program 1 times [2019-12-07 17:37:35,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:35,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630829077] [2019-12-07 17:37:35,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:35,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:35,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630829077] [2019-12-07 17:37:35,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:35,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:37:35,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757705108] [2019-12-07 17:37:35,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:37:35,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:35,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:37:35,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:37:35,264 INFO L87 Difference]: Start difference. First operand 4725 states and 11319 transitions. Second operand 5 states. [2019-12-07 17:37:35,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:35,298 INFO L93 Difference]: Finished difference Result 1095 states and 2326 transitions. [2019-12-07 17:37:35,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:37:35,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 17:37:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:35,301 INFO L225 Difference]: With dead ends: 1095 [2019-12-07 17:37:35,301 INFO L226 Difference]: Without dead ends: 991 [2019-12-07 17:37:35,301 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 17:37:35,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-12-07 17:37:35,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 949. [2019-12-07 17:37:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-12-07 17:37:35,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2023 transitions. [2019-12-07 17:37:35,313 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2023 transitions. Word has length 37 [2019-12-07 17:37:35,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:35,314 INFO L462 AbstractCegarLoop]: Abstraction has 949 states and 2023 transitions. [2019-12-07 17:37:35,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:37:35,314 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2023 transitions. [2019-12-07 17:37:35,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 17:37:35,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:35,317 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:35,317 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:35,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:35,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1081276424, now seen corresponding path program 1 times [2019-12-07 17:37:35,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:35,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231863882] [2019-12-07 17:37:35,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:35,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231863882] [2019-12-07 17:37:35,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:35,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:37:35,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948297342] [2019-12-07 17:37:35,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:37:35,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:35,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:37:35,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:37:35,407 INFO L87 Difference]: Start difference. First operand 949 states and 2023 transitions. Second operand 6 states. [2019-12-07 17:37:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:35,758 INFO L93 Difference]: Finished difference Result 1405 states and 2968 transitions. [2019-12-07 17:37:35,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:37:35,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-07 17:37:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:35,761 INFO L225 Difference]: With dead ends: 1405 [2019-12-07 17:37:35,761 INFO L226 Difference]: Without dead ends: 1405 [2019-12-07 17:37:35,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:37:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-12-07 17:37:35,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1132. [2019-12-07 17:37:35,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-12-07 17:37:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2413 transitions. [2019-12-07 17:37:35,770 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 2413 transitions. Word has length 68 [2019-12-07 17:37:35,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:35,770 INFO L462 AbstractCegarLoop]: Abstraction has 1132 states and 2413 transitions. [2019-12-07 17:37:35,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:37:35,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 2413 transitions. [2019-12-07 17:37:35,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 17:37:35,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:35,772 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:35,772 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:35,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:35,772 INFO L82 PathProgramCache]: Analyzing trace with hash 188736084, now seen corresponding path program 2 times [2019-12-07 17:37:35,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:35,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569284353] [2019-12-07 17:37:35,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:35,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569284353] [2019-12-07 17:37:35,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:35,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:37:35,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232444837] [2019-12-07 17:37:35,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:37:35,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:35,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:37:35,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:37:35,856 INFO L87 Difference]: Start difference. First operand 1132 states and 2413 transitions. Second operand 7 states. [2019-12-07 17:37:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:36,258 INFO L93 Difference]: Finished difference Result 1322 states and 2786 transitions. [2019-12-07 17:37:36,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:37:36,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-07 17:37:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:36,260 INFO L225 Difference]: With dead ends: 1322 [2019-12-07 17:37:36,260 INFO L226 Difference]: Without dead ends: 1322 [2019-12-07 17:37:36,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:37:36,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-12-07 17:37:36,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1237. [2019-12-07 17:37:36,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-12-07 17:37:36,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2629 transitions. [2019-12-07 17:37:36,269 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2629 transitions. Word has length 68 [2019-12-07 17:37:36,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:36,269 INFO L462 AbstractCegarLoop]: Abstraction has 1237 states and 2629 transitions. [2019-12-07 17:37:36,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:37:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2629 transitions. [2019-12-07 17:37:36,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 17:37:36,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:36,271 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:36,272 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:36,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:36,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1869906086, now seen corresponding path program 3 times [2019-12-07 17:37:36,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:36,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120039330] [2019-12-07 17:37:36,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:36,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120039330] [2019-12-07 17:37:36,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:36,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:37:36,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863295570] [2019-12-07 17:37:36,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:37:36,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:36,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:37:36,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:37:36,345 INFO L87 Difference]: Start difference. First operand 1237 states and 2629 transitions. Second operand 5 states. [2019-12-07 17:37:36,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:36,505 INFO L93 Difference]: Finished difference Result 1390 states and 2909 transitions. [2019-12-07 17:37:36,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:37:36,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-07 17:37:36,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:36,507 INFO L225 Difference]: With dead ends: 1390 [2019-12-07 17:37:36,507 INFO L226 Difference]: Without dead ends: 1390 [2019-12-07 17:37:36,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:37:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-12-07 17:37:36,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1279. [2019-12-07 17:37:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-12-07 17:37:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 2714 transitions. [2019-12-07 17:37:36,517 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 2714 transitions. Word has length 68 [2019-12-07 17:37:36,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:36,517 INFO L462 AbstractCegarLoop]: Abstraction has 1279 states and 2714 transitions. [2019-12-07 17:37:36,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:37:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 2714 transitions. [2019-12-07 17:37:36,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 17:37:36,519 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:36,519 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:36,519 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:36,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:36,519 INFO L82 PathProgramCache]: Analyzing trace with hash 395185618, now seen corresponding path program 4 times [2019-12-07 17:37:36,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:36,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286774464] [2019-12-07 17:37:36,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:36,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:36,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286774464] [2019-12-07 17:37:36,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:36,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:37:36,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743890263] [2019-12-07 17:37:36,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:37:36,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:36,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:37:36,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:37:36,605 INFO L87 Difference]: Start difference. First operand 1279 states and 2714 transitions. Second operand 7 states. [2019-12-07 17:37:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:36,928 INFO L93 Difference]: Finished difference Result 2280 states and 4779 transitions. [2019-12-07 17:37:36,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:37:36,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-07 17:37:36,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:36,930 INFO L225 Difference]: With dead ends: 2280 [2019-12-07 17:37:36,931 INFO L226 Difference]: Without dead ends: 2280 [2019-12-07 17:37:36,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:37:36,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2019-12-07 17:37:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 1321. [2019-12-07 17:37:36,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-12-07 17:37:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 2819 transitions. [2019-12-07 17:37:36,945 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 2819 transitions. Word has length 68 [2019-12-07 17:37:36,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:36,945 INFO L462 AbstractCegarLoop]: Abstraction has 1321 states and 2819 transitions. [2019-12-07 17:37:36,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:37:36,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 2819 transitions. [2019-12-07 17:37:36,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 17:37:36,947 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:36,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:36,947 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:36,947 INFO L82 PathProgramCache]: Analyzing trace with hash 155410772, now seen corresponding path program 5 times [2019-12-07 17:37:36,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:36,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664439576] [2019-12-07 17:37:36,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:36,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664439576] [2019-12-07 17:37:36,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:36,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:37:36,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675699124] [2019-12-07 17:37:36,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:37:36,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:36,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:37:36,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:37:36,990 INFO L87 Difference]: Start difference. First operand 1321 states and 2819 transitions. Second operand 4 states. [2019-12-07 17:37:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:37,176 INFO L93 Difference]: Finished difference Result 1834 states and 3906 transitions. [2019-12-07 17:37:37,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:37:37,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-07 17:37:37,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:37,179 INFO L225 Difference]: With dead ends: 1834 [2019-12-07 17:37:37,179 INFO L226 Difference]: Without dead ends: 1834 [2019-12-07 17:37:37,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:37:37,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2019-12-07 17:37:37,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1433. [2019-12-07 17:37:37,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2019-12-07 17:37:37,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 3008 transitions. [2019-12-07 17:37:37,191 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 3008 transitions. Word has length 68 [2019-12-07 17:37:37,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:37,192 INFO L462 AbstractCegarLoop]: Abstraction has 1433 states and 3008 transitions. [2019-12-07 17:37:37,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:37:37,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 3008 transitions. [2019-12-07 17:37:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 17:37:37,193 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:37,193 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:37,193 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:37,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:37,194 INFO L82 PathProgramCache]: Analyzing trace with hash 29507545, now seen corresponding path program 1 times [2019-12-07 17:37:37,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:37,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374072282] [2019-12-07 17:37:37,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:37,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374072282] [2019-12-07 17:37:37,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:37,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:37:37,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914414271] [2019-12-07 17:37:37,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:37:37,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:37,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:37:37,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:37:37,330 INFO L87 Difference]: Start difference. First operand 1433 states and 3008 transitions. Second operand 9 states. [2019-12-07 17:37:37,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:37,909 INFO L93 Difference]: Finished difference Result 2220 states and 4604 transitions. [2019-12-07 17:37:37,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:37:37,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-12-07 17:37:37,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:37,911 INFO L225 Difference]: With dead ends: 2220 [2019-12-07 17:37:37,911 INFO L226 Difference]: Without dead ends: 2220 [2019-12-07 17:37:37,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:37:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2019-12-07 17:37:37,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 1661. [2019-12-07 17:37:37,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1661 states. [2019-12-07 17:37:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 3489 transitions. [2019-12-07 17:37:37,930 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 3489 transitions. Word has length 69 [2019-12-07 17:37:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:37,930 INFO L462 AbstractCegarLoop]: Abstraction has 1661 states and 3489 transitions. [2019-12-07 17:37:37,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:37:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 3489 transitions. [2019-12-07 17:37:37,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 17:37:37,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:37,933 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:37,933 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:37,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:37,933 INFO L82 PathProgramCache]: Analyzing trace with hash -869953896, now seen corresponding path program 1 times [2019-12-07 17:37:37,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:37,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358705628] [2019-12-07 17:37:37,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:38,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358705628] [2019-12-07 17:37:38,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:38,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:37:38,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093307851] [2019-12-07 17:37:38,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:37:38,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:38,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:37:38,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:37:38,002 INFO L87 Difference]: Start difference. First operand 1661 states and 3489 transitions. Second operand 7 states. [2019-12-07 17:37:38,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:38,339 INFO L93 Difference]: Finished difference Result 2575 states and 5380 transitions. [2019-12-07 17:37:38,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:37:38,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-07 17:37:38,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:38,341 INFO L225 Difference]: With dead ends: 2575 [2019-12-07 17:37:38,341 INFO L226 Difference]: Without dead ends: 2575 [2019-12-07 17:37:38,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:37:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-12-07 17:37:38,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 1652. [2019-12-07 17:37:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-12-07 17:37:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 3471 transitions. [2019-12-07 17:37:38,356 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 3471 transitions. Word has length 69 [2019-12-07 17:37:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:38,356 INFO L462 AbstractCegarLoop]: Abstraction has 1652 states and 3471 transitions. [2019-12-07 17:37:38,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:37:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 3471 transitions. [2019-12-07 17:37:38,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 17:37:38,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:38,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:38,358 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:38,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:38,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1965702760, now seen corresponding path program 2 times [2019-12-07 17:37:38,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:38,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643073963] [2019-12-07 17:37:38,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:38,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643073963] [2019-12-07 17:37:38,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:38,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:37:38,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560299244] [2019-12-07 17:37:38,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:37:38,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:38,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:37:38,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:37:38,423 INFO L87 Difference]: Start difference. First operand 1652 states and 3471 transitions. Second operand 6 states. [2019-12-07 17:37:38,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:38,493 INFO L93 Difference]: Finished difference Result 2132 states and 4457 transitions. [2019-12-07 17:37:38,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:37:38,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-07 17:37:38,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:38,493 INFO L225 Difference]: With dead ends: 2132 [2019-12-07 17:37:38,494 INFO L226 Difference]: Without dead ends: 421 [2019-12-07 17:37:38,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:37:38,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-12-07 17:37:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 375. [2019-12-07 17:37:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-12-07 17:37:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 673 transitions. [2019-12-07 17:37:38,497 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 673 transitions. Word has length 69 [2019-12-07 17:37:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:38,497 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 673 transitions. [2019-12-07 17:37:38,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:37:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 673 transitions. [2019-12-07 17:37:38,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 17:37:38,498 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:38,498 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:38,498 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:38,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:38,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2138437264, now seen corresponding path program 3 times [2019-12-07 17:37:38,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:38,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274925998] [2019-12-07 17:37:38,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:38,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274925998] [2019-12-07 17:37:38,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:38,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:37:38,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547264718] [2019-12-07 17:37:38,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:37:38,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:38,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:37:38,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:37:38,531 INFO L87 Difference]: Start difference. First operand 375 states and 673 transitions. Second operand 3 states. [2019-12-07 17:37:38,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:38,558 INFO L93 Difference]: Finished difference Result 374 states and 671 transitions. [2019-12-07 17:37:38,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:37:38,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-07 17:37:38,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:38,558 INFO L225 Difference]: With dead ends: 374 [2019-12-07 17:37:38,558 INFO L226 Difference]: Without dead ends: 374 [2019-12-07 17:37:38,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:37:38,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-12-07 17:37:38,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 252. [2019-12-07 17:37:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 17:37:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 447 transitions. [2019-12-07 17:37:38,562 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 447 transitions. Word has length 69 [2019-12-07 17:37:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:38,563 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 447 transitions. [2019-12-07 17:37:38,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:37:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 447 transitions. [2019-12-07 17:37:38,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 17:37:38,563 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:38,563 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:38,563 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:38,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:38,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1517196574, now seen corresponding path program 1 times [2019-12-07 17:37:38,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:38,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963677336] [2019-12-07 17:37:38,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:38,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963677336] [2019-12-07 17:37:38,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:38,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:37:38,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246836657] [2019-12-07 17:37:38,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:37:38,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:38,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:37:38,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:37:38,598 INFO L87 Difference]: Start difference. First operand 252 states and 447 transitions. Second operand 3 states. [2019-12-07 17:37:38,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:38,607 INFO L93 Difference]: Finished difference Result 242 states and 411 transitions. [2019-12-07 17:37:38,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:37:38,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-07 17:37:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:38,607 INFO L225 Difference]: With dead ends: 242 [2019-12-07 17:37:38,607 INFO L226 Difference]: Without dead ends: 242 [2019-12-07 17:37:38,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:37:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-07 17:37:38,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 224. [2019-12-07 17:37:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-07 17:37:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 377 transitions. [2019-12-07 17:37:38,610 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 377 transitions. Word has length 70 [2019-12-07 17:37:38,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:38,610 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 377 transitions. [2019-12-07 17:37:38,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:37:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 377 transitions. [2019-12-07 17:37:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 17:37:38,610 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:38,610 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:38,611 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:38,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:38,611 INFO L82 PathProgramCache]: Analyzing trace with hash -642215500, now seen corresponding path program 1 times [2019-12-07 17:37:38,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:38,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924458425] [2019-12-07 17:37:38,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:37:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:37:38,699 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:37:38,699 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:37:38,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~weak$$choice0~0_155) (= v_~y~0_275 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_30| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_30|) |v_ULTIMATE.start_main_~#t1719~0.offset_22| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd1~0_174 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_865 0) (= 0 v_~y$w_buff0~0_221) (= v_~y$w_buff1~0_203 0) (= v_~y$r_buff0_thd0~0_374 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1719~0.base_30|) (= v_~y$r_buff1_thd0~0_352 0) (= v_~__unbuffered_p1_EBX~0_37 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1719~0.base_30| 4)) (= v_~y$mem_tmp~0_168 0) (= v_~y$w_buff1_used~0_515 0) (= 0 v_~y$r_buff1_thd2~0_343) (= 0 v_~__unbuffered_p1_EAX~0_60) (= 0 v_~y$r_buff0_thd2~0_460) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= v_~weak$$choice2~0_236 0) (= v_~main$tmp_guard0~0_33 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_25 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_30|) 0) (= v_~y$r_buff0_thd1~0_98 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~__unbuffered_cnt~0_42) (= |v_ULTIMATE.start_main_~#t1719~0.offset_22| 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_30| 1)) (= v_~main$tmp_guard1~0_40 0) (= v_~y$flush_delayed~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_125|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_59|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_33|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_168, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_98, ~y$flush_delayed~0=v_~y$flush_delayed~0_204, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_155, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_83|, ~y$w_buff1~0=v_~y$w_buff1~0_203, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_460, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_352, ~x~0=v_~x~0_25, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_865, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_22|, ~y$w_buff0~0=v_~y$w_buff0~0_221, ~y~0=v_~y~0_275, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_37, ULTIMATE.start_main_~#t1719~0.base=|v_ULTIMATE.start_main_~#t1719~0.base_30|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_~#t1719~0.offset=|v_ULTIMATE.start_main_~#t1719~0.offset_22|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_343, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_162|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_374, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_236, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_515} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1720~0.offset, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1720~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1719~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1719~0.offset, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:37:38,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13|) |v_ULTIMATE.start_main_~#t1720~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1720~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1720~0.base_13| 4)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1720~0.base_13|) (= (store |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13| 1) |v_#valid_26|) (= 0 |v_ULTIMATE.start_main_~#t1720~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_11|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1720~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1720~0.base] because there is no mapped edge [2019-12-07 17:37:38,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~y$w_buff0_used~0_156 1) (= v_~y$w_buff0~0_36 v_~y$w_buff1~0_27) (= 2 v_~y$w_buff0~0_35) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~y$w_buff0_used~0_156 256))) (not (= 0 (mod v_~y$w_buff1_used~0_77 256))))) 1 0)) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff1_used~0_77 v_~y$w_buff0_used~0_157)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_157, ~y$w_buff0~0=v_~y$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_156, ~y$w_buff1~0=v_~y$w_buff1~0_27, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~y$w_buff0~0=v_~y$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:37:38,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L759-2-->L759-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite11_Out1557418489| |P1Thread1of1ForFork1_#t~ite12_Out1557418489|)) (.cse1 (= (mod ~y$w_buff0_used~0_In1557418489 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1557418489 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1557418489| ~y$w_buff1~0_In1557418489) .cse2) (and (= |P1Thread1of1ForFork1_#t~ite11_Out1557418489| ~y$w_buff0~0_In1557418489) .cse2 (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1557418489, ~y$w_buff1~0=~y$w_buff1~0_In1557418489, ~y$w_buff0~0=~y$w_buff0~0_In1557418489, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1557418489} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1557418489, ~y$w_buff1~0=~y$w_buff1~0_In1557418489, ~y$w_buff0~0=~y$w_buff0~0_In1557418489, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1557418489, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1557418489|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1557418489|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 17:37:38,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_138 v_~y$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_137, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:37:38,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1690377638 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite31_Out-1690377638| ~y~0_In-1690377638)) (and (= ~y$mem_tmp~0_In-1690377638 |P1Thread1of1ForFork1_#t~ite31_Out-1690377638|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1690377638, ~y$flush_delayed~0=~y$flush_delayed~0_In-1690377638, ~y~0=~y~0_In-1690377638} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1690377638, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1690377638|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1690377638, ~y~0=~y~0_In-1690377638} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 17:37:38,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-975277534 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-975277534| |P0Thread1of1ForFork0_#t~ite4_Out-975277534|)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-975277534 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-975277534| ~y~0_In-975277534) (or .cse0 .cse1) .cse2) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-975277534| ~y$w_buff1~0_In-975277534) (not .cse1) .cse2 (not .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-975277534, ~y$w_buff1~0=~y$w_buff1~0_In-975277534, ~y~0=~y~0_In-975277534, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-975277534} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-975277534, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-975277534|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-975277534|, ~y$w_buff1~0=~y$w_buff1~0_In-975277534, ~y~0=~y~0_In-975277534, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-975277534} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 17:37:38,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1592922999 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1592922999 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1592922999| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1592922999| ~y$w_buff0_used~0_In-1592922999) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1592922999, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1592922999} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1592922999|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1592922999, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1592922999} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:37:38,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L732-->L732-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In17389705 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In17389705 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In17389705 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In17389705 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out17389705| ~y$w_buff1_used~0_In17389705) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out17389705|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In17389705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In17389705, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In17389705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In17389705} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out17389705|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In17389705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In17389705, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In17389705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In17389705} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:37:38,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1235743266 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1235743266 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1235743266|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In1235743266 |P0Thread1of1ForFork0_#t~ite7_Out1235743266|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1235743266, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1235743266} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1235743266, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1235743266|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1235743266} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 17:37:38,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In-97530069 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-97530069 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-97530069 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-97530069 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-97530069 |P0Thread1of1ForFork0_#t~ite8_Out-97530069|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-97530069|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-97530069, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-97530069, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-97530069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97530069} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-97530069, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-97530069, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-97530069|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-97530069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97530069} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:37:38,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_141 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_141, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:37:38,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In952652855 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In952652855 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out952652855| ~y$w_buff0_used~0_In952652855) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out952652855|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In952652855, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In952652855} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In952652855, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In952652855, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out952652855|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:37:38,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1794142357 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1794142357 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1794142357 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1794142357 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1794142357| ~y$w_buff1_used~0_In-1794142357) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1794142357|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1794142357, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1794142357, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1794142357, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1794142357} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1794142357, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1794142357, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1794142357, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1794142357|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1794142357} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:37:38,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L777-->L778: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-325246058 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-325246058 256) 0)) (.cse2 (= ~y$r_buff0_thd2~0_In-325246058 ~y$r_buff0_thd2~0_Out-325246058))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out-325246058)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-325246058, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-325246058} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-325246058, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-325246058, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-325246058|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:37:38,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1683006687 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1683006687 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1683006687 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1683006687 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-1683006687| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite37_Out-1683006687| ~y$r_buff1_thd2~0_In-1683006687) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1683006687, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1683006687, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1683006687, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1683006687} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1683006687, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1683006687, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1683006687, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1683006687|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1683006687} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:37:38,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~y$r_buff1_thd2~0_155 |v_P1Thread1of1ForFork1_#t~ite37_20|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_20|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_155, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_19|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:37:38,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_55 256)) (= (mod v_~y$w_buff0_used~0_124 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:37:38,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1087030637 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1087030637 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1087030637| ~y$w_buff1~0_In-1087030637)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1087030637| ~y~0_In-1087030637) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1087030637, ~y~0=~y~0_In-1087030637, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1087030637, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1087030637} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1087030637|, ~y$w_buff1~0=~y$w_buff1~0_In-1087030637, ~y~0=~y~0_In-1087030637, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1087030637, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1087030637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:37:38,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 17:37:38,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-343346094 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-343346094 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-343346094| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-343346094| ~y$w_buff0_used~0_In-343346094)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-343346094, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-343346094} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-343346094, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-343346094, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-343346094|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:37:38,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In545419732 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In545419732 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In545419732 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In545419732 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In545419732 |ULTIMATE.start_main_#t~ite43_Out545419732|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite43_Out545419732|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In545419732, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In545419732, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In545419732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In545419732} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In545419732, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In545419732, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out545419732|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In545419732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In545419732} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:37:38,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1660404567 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1660404567 256)))) (or (and (= ~y$r_buff0_thd0~0_In-1660404567 |ULTIMATE.start_main_#t~ite44_Out-1660404567|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1660404567|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1660404567, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1660404567} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1660404567, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1660404567, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1660404567|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:37:38,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1877897929 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1877897929 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1877897929 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1877897929 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1877897929|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In1877897929 |ULTIMATE.start_main_#t~ite45_Out1877897929|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1877897929, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1877897929, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1877897929, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1877897929} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1877897929, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1877897929, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1877897929, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1877897929|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1877897929} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:37:38,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-879163826 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite68_Out-879163826| ~y~0_In-879163826)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite68_Out-879163826| ~y$mem_tmp~0_In-879163826)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-879163826, ~y$flush_delayed~0=~y$flush_delayed~0_In-879163826, ~y~0=~y~0_In-879163826} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-879163826, ~y$flush_delayed~0=~y$flush_delayed~0_In-879163826, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-879163826|, ~y~0=~y~0_In-879163826} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 17:37:38,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_262 |v_ULTIMATE.start_main_#t~ite68_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$flush_delayed~0_189 0)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_189, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_39|, ~y~0=v_~y~0_262, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:37:38,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:37:38 BasicIcfg [2019-12-07 17:37:38,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:37:38,783 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:37:38,783 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:37:38,783 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:37:38,783 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:37:23" (3/4) ... [2019-12-07 17:37:38,785 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:37:38,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~weak$$choice0~0_155) (= v_~y~0_275 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_30| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_30|) |v_ULTIMATE.start_main_~#t1719~0.offset_22| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd1~0_174 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_865 0) (= 0 v_~y$w_buff0~0_221) (= v_~y$w_buff1~0_203 0) (= v_~y$r_buff0_thd0~0_374 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1719~0.base_30|) (= v_~y$r_buff1_thd0~0_352 0) (= v_~__unbuffered_p1_EBX~0_37 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1719~0.base_30| 4)) (= v_~y$mem_tmp~0_168 0) (= v_~y$w_buff1_used~0_515 0) (= 0 v_~y$r_buff1_thd2~0_343) (= 0 v_~__unbuffered_p1_EAX~0_60) (= 0 v_~y$r_buff0_thd2~0_460) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= v_~weak$$choice2~0_236 0) (= v_~main$tmp_guard0~0_33 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_25 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_30|) 0) (= v_~y$r_buff0_thd1~0_98 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~__unbuffered_cnt~0_42) (= |v_ULTIMATE.start_main_~#t1719~0.offset_22| 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_30| 1)) (= v_~main$tmp_guard1~0_40 0) (= v_~y$flush_delayed~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_125|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_59|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_33|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_168, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_98, ~y$flush_delayed~0=v_~y$flush_delayed~0_204, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_155, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_83|, ~y$w_buff1~0=v_~y$w_buff1~0_203, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_460, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_352, ~x~0=v_~x~0_25, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_865, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_22|, ~y$w_buff0~0=v_~y$w_buff0~0_221, ~y~0=v_~y~0_275, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_37, ULTIMATE.start_main_~#t1719~0.base=|v_ULTIMATE.start_main_~#t1719~0.base_30|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_~#t1719~0.offset=|v_ULTIMATE.start_main_~#t1719~0.offset_22|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_343, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_162|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_374, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_236, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_515} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1720~0.offset, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1720~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1719~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1719~0.offset, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:37:38,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13|) |v_ULTIMATE.start_main_~#t1720~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1720~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1720~0.base_13| 4)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1720~0.base_13|) (= (store |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13| 1) |v_#valid_26|) (= 0 |v_ULTIMATE.start_main_~#t1720~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_11|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1720~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1720~0.base] because there is no mapped edge [2019-12-07 17:37:38,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~y$w_buff0_used~0_156 1) (= v_~y$w_buff0~0_36 v_~y$w_buff1~0_27) (= 2 v_~y$w_buff0~0_35) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~y$w_buff0_used~0_156 256))) (not (= 0 (mod v_~y$w_buff1_used~0_77 256))))) 1 0)) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff1_used~0_77 v_~y$w_buff0_used~0_157)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_157, ~y$w_buff0~0=v_~y$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_156, ~y$w_buff1~0=v_~y$w_buff1~0_27, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~y$w_buff0~0=v_~y$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:37:38,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L759-2-->L759-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite11_Out1557418489| |P1Thread1of1ForFork1_#t~ite12_Out1557418489|)) (.cse1 (= (mod ~y$w_buff0_used~0_In1557418489 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1557418489 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1557418489| ~y$w_buff1~0_In1557418489) .cse2) (and (= |P1Thread1of1ForFork1_#t~ite11_Out1557418489| ~y$w_buff0~0_In1557418489) .cse2 (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1557418489, ~y$w_buff1~0=~y$w_buff1~0_In1557418489, ~y$w_buff0~0=~y$w_buff0~0_In1557418489, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1557418489} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1557418489, ~y$w_buff1~0=~y$w_buff1~0_In1557418489, ~y$w_buff0~0=~y$w_buff0~0_In1557418489, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1557418489, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1557418489|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1557418489|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 17:37:38,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_138 v_~y$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_137, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:37:38,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1690377638 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite31_Out-1690377638| ~y~0_In-1690377638)) (and (= ~y$mem_tmp~0_In-1690377638 |P1Thread1of1ForFork1_#t~ite31_Out-1690377638|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1690377638, ~y$flush_delayed~0=~y$flush_delayed~0_In-1690377638, ~y~0=~y~0_In-1690377638} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1690377638, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1690377638|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1690377638, ~y~0=~y~0_In-1690377638} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 17:37:38,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-975277534 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-975277534| |P0Thread1of1ForFork0_#t~ite4_Out-975277534|)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-975277534 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-975277534| ~y~0_In-975277534) (or .cse0 .cse1) .cse2) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-975277534| ~y$w_buff1~0_In-975277534) (not .cse1) .cse2 (not .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-975277534, ~y$w_buff1~0=~y$w_buff1~0_In-975277534, ~y~0=~y~0_In-975277534, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-975277534} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-975277534, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-975277534|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-975277534|, ~y$w_buff1~0=~y$w_buff1~0_In-975277534, ~y~0=~y~0_In-975277534, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-975277534} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 17:37:38,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1592922999 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1592922999 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1592922999| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1592922999| ~y$w_buff0_used~0_In-1592922999) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1592922999, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1592922999} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1592922999|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1592922999, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1592922999} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:37:38,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L732-->L732-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In17389705 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In17389705 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In17389705 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In17389705 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out17389705| ~y$w_buff1_used~0_In17389705) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out17389705|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In17389705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In17389705, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In17389705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In17389705} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out17389705|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In17389705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In17389705, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In17389705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In17389705} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:37:38,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1235743266 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1235743266 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1235743266|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In1235743266 |P0Thread1of1ForFork0_#t~ite7_Out1235743266|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1235743266, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1235743266} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1235743266, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1235743266|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1235743266} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 17:37:38,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In-97530069 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-97530069 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-97530069 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-97530069 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-97530069 |P0Thread1of1ForFork0_#t~ite8_Out-97530069|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-97530069|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-97530069, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-97530069, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-97530069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97530069} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-97530069, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-97530069, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-97530069|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-97530069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97530069} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:37:38,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_141 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_141, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:37:38,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In952652855 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In952652855 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out952652855| ~y$w_buff0_used~0_In952652855) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out952652855|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In952652855, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In952652855} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In952652855, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In952652855, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out952652855|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:37:38,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1794142357 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1794142357 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1794142357 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1794142357 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1794142357| ~y$w_buff1_used~0_In-1794142357) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1794142357|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1794142357, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1794142357, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1794142357, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1794142357} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1794142357, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1794142357, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1794142357, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1794142357|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1794142357} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:37:38,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L777-->L778: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-325246058 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-325246058 256) 0)) (.cse2 (= ~y$r_buff0_thd2~0_In-325246058 ~y$r_buff0_thd2~0_Out-325246058))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out-325246058)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-325246058, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-325246058} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-325246058, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-325246058, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-325246058|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:37:38,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1683006687 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1683006687 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1683006687 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1683006687 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-1683006687| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite37_Out-1683006687| ~y$r_buff1_thd2~0_In-1683006687) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1683006687, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1683006687, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1683006687, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1683006687} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1683006687, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1683006687, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1683006687, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1683006687|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1683006687} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:37:38,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~y$r_buff1_thd2~0_155 |v_P1Thread1of1ForFork1_#t~ite37_20|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_20|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_155, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_19|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:37:38,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_55 256)) (= (mod v_~y$w_buff0_used~0_124 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:37:38,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1087030637 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1087030637 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1087030637| ~y$w_buff1~0_In-1087030637)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1087030637| ~y~0_In-1087030637) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1087030637, ~y~0=~y~0_In-1087030637, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1087030637, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1087030637} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1087030637|, ~y$w_buff1~0=~y$w_buff1~0_In-1087030637, ~y~0=~y~0_In-1087030637, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1087030637, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1087030637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:37:38,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 17:37:38,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-343346094 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-343346094 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-343346094| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-343346094| ~y$w_buff0_used~0_In-343346094)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-343346094, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-343346094} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-343346094, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-343346094, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-343346094|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:37:38,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In545419732 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In545419732 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In545419732 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In545419732 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In545419732 |ULTIMATE.start_main_#t~ite43_Out545419732|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite43_Out545419732|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In545419732, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In545419732, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In545419732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In545419732} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In545419732, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In545419732, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out545419732|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In545419732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In545419732} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:37:38,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1660404567 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1660404567 256)))) (or (and (= ~y$r_buff0_thd0~0_In-1660404567 |ULTIMATE.start_main_#t~ite44_Out-1660404567|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1660404567|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1660404567, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1660404567} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1660404567, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1660404567, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1660404567|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:37:38,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1877897929 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1877897929 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1877897929 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1877897929 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1877897929|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In1877897929 |ULTIMATE.start_main_#t~ite45_Out1877897929|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1877897929, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1877897929, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1877897929, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1877897929} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1877897929, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1877897929, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1877897929, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1877897929|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1877897929} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:37:38,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-879163826 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite68_Out-879163826| ~y~0_In-879163826)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite68_Out-879163826| ~y$mem_tmp~0_In-879163826)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-879163826, ~y$flush_delayed~0=~y$flush_delayed~0_In-879163826, ~y~0=~y~0_In-879163826} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-879163826, ~y$flush_delayed~0=~y$flush_delayed~0_In-879163826, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-879163826|, ~y~0=~y~0_In-879163826} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 17:37:38,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_262 |v_ULTIMATE.start_main_#t~ite68_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$flush_delayed~0_189 0)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_189, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_39|, ~y~0=v_~y~0_262, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:37:38,871 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5e3b6f35-80f7-438e-9134-802c4fc301d3/bin/uautomizer/witness.graphml [2019-12-07 17:37:38,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:37:38,872 INFO L168 Benchmark]: Toolchain (without parser) took 16751.34 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 905.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:37:38,873 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:37:38,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:37:38,873 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:37:38,873 INFO L168 Benchmark]: Boogie Preprocessor took 29.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:37:38,874 INFO L168 Benchmark]: RCFGBuilder took 441.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:37:38,874 INFO L168 Benchmark]: TraceAbstraction took 15760.62 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 966.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -123.0 MB). Peak memory consumption was 843.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:37:38,874 INFO L168 Benchmark]: Witness Printer took 88.45 ms. Allocated memory is still 2.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:37:38,875 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 441.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15760.62 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 966.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -123.0 MB). Peak memory consumption was 843.8 MB. Max. memory is 11.5 GB. * Witness Printer took 88.45 ms. Allocated memory is still 2.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 189 ProgramPointsBefore, 112 ProgramPointsAfterwards, 244 TransitionsBefore, 137 TransitionsAfterwards, 25246 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 55 ConcurrentYvCompositions, 33 ChoiceCompositions, 10314 VarBasedMoverChecksPositive, 294 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 142511 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1719, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK 0 pthread_create(&t1720, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L750] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L751] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L752] 2 y$r_buff0_thd2 = (_Bool)1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 [L771] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 x = 1 [L727] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L730] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L732] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L733] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L809] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L812] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 0 y$flush_delayed = weak$$choice2 [L815] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L817] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L818] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L819] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L820] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L822] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3494 SDtfs, 3071 SDslu, 7176 SDs, 0 SdLazy, 4373 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 34 SyntacticMatches, 18 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47611occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 25722 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 863 NumberOfCodeBlocks, 863 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 776 ConstructedInterpolants, 0 QuantifiedInterpolants, 140437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...